560 research outputs found
Control of functional differential equations with function space boundary conditions
Problems involving functional differential equations with terminal conditions in function space are considered. Their application to mechanical and electrical systems is discussed. Investigations of controllability, existence of optimal controls, and necessary and sufficient conditions for optimality are reported
Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems
Necessary and sufficient conditions for convexity and strong convexity,
respectively, of sublevel sets that are defined by finitely many real-valued
-maps are presented. A novel characterization of strongly convex sets
in terms of the so-called local quadratic support is proved. The results
concerning strong convexity are used to derive sufficient conditions for
attainable sets of continuous-time nonlinear systems to be strongly convex. An
application of these conditions is a novel method to over-approximate
attainable sets when strong convexity is present.Comment: 20 pages, 3 figure
Global entrainment of transcriptional systems to periodic inputs
This paper addresses the problem of giving conditions for transcriptional
systems to be globally entrained to external periodic inputs. By using
contraction theory, a powerful tool from dynamical systems theory, it is shown
that certain systems driven by external periodic signals have the property that
all solutions converge to a fixed limit cycle. General results are proved, and
the properties are verified in the specific case of some models of
transcriptional systems. The basic mathematical results needed from contraction
theory are proved in the paper, making it self-contained
A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
This paper presents a methodology for safety verification of continuous and hybrid systems in the worst-case and stochastic settings. In the worst-case setting, a function of state termed barrier certificate is used to certify that all trajectories of the system starting from a given initial set do not enter an unsafe region. No explicit computation of reachable sets is required in the construction of barrier certificates, which makes it possible to handle nonlinearity, uncertainty, and constraints directly within this framework. In the stochastic setting, our method computes an upper bound on the probability that a trajectory of the system reaches the unsafe set, a bound whose validity is proven by the existence of a barrier certificate. For polynomial systems, barrier certificates can be constructed using convex optimization, and hence the method is computationally tractable. Some examples are provided to illustrate the use of the method
- …