Results 1  10
of
49
Computational techniques for the verification of hybrid systems
 Proceedings of the IEEE
, 2003
"... Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems that involve the interaction of both discrete state systems, represented by finite automata, and continuous sta ..."
Abstract

Cited by 72 (9 self)
 Add to MetaCart
Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems that involve the interaction of both discrete state systems, represented by finite automata, and continuous state dynamics, represented by differential equations. The embedded autopilot of a modern commercial jet is a prime example of a hybrid system: the autopilot modes correspond to the application of different control laws, and the logic of mode switching is determined by the continuous state dynamics of the aircraft, as well as through interaction with the pilot. To understand the behavior of hybrid systems, to simulate, and to control these systems, theoretical advances, analyses, and numerical tools are needed. In this paper, we first present a general model for a hybrid system along with an overview of methods for verifying continuous and hybrid systems. We describe a particular verification
Hybrid systems: Generalized solutions and robust stability
 In IFAC Symposium on Nonliear Control Systems
, 2004
"... Abstract: Robust asymptotic stability for hybrid systems is considered. For this purpose, a generalized solution concept is developed. The first step is to characterize a hybrid time domain that permits an efficient description of the convergence of a sequence of solutions. Graph convergence is used ..."
Abstract

Cited by 46 (13 self)
 Add to MetaCart
Abstract: Robust asymptotic stability for hybrid systems is considered. For this purpose, a generalized solution concept is developed. The first step is to characterize a hybrid time domain that permits an efficient description of the convergence of a sequence of solutions. Graph convergence is used. Then a generalized solution definition is given that leads to continuity with respect to initial conditions and perturbations of the system data. This property enables new results on necessary conditions for asymptotic stability in hybrid systems.
Computational Techniques for the Verification and Control of Hybrid Systems
 PROCEEDINGS OF THE IEEE
, 2003
"... Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems which involve the interaction of both discrete state systems, represented by finite automata, and continuous ..."
Abstract

Cited by 43 (9 self)
 Add to MetaCart
Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems which involve the interaction of both discrete state systems, represented by finite automata, and continuous state dynamics, represented by differential equations. The embedded autopilot of a modern commercial jet is a prime example of a hybrid system: the autopilot modes correspond to the application of different control laws, and the logic of mode switching is determined by the continuous state dynamics of the aircraft, as well as through interaction with the pilot. Embedded
Results on inputtostate stability for hybrid systems
, 2005
"... We show that, like continuoustime systems, zeroinput locally asymptotically stable hybrid systems are locally inputtostatestable (LISS). We demonstrate by examples that, unlike continuoustime systems, zeroinput locally exponentially stable hybrid systems may not be LISS with linear gain, inpu ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
We show that, like continuoustime systems, zeroinput locally asymptotically stable hybrid systems are locally inputtostatestable (LISS). We demonstrate by examples that, unlike continuoustime systems, zeroinput locally exponentially stable hybrid systems may not be LISS with linear gain, inputtostate stable (ISS) hybrid systems may not admit any ISS Lyapunov function, and nonuniform ISS hybrid systems may not be (uniformly) ISS. We then provide a strengthened ISS condition as an equivalence to the existence of an ISS Lyapunov function for hybrid systems. This strengthened condition reduces to standard ISS for continuoustime and discretetime systems. Finally under some other assumptions we establish the equivalence among ISS, several asymptotic characterizations of ISS, and the existence of an ISS Lyapunov function for hybrid systems.
Nondeterministic temporal logics for general Flow systems
, 2004
"... In this paper, we use the constructs of branching temporal logic to formalize reasoning about a class of general flow systems, including discretetime transition systems, continuoustime differential inclusions, and hybridtime systems such as hybrid automata. We introduce Full General Flow Logic, ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
(Show Context)
In this paper, we use the constructs of branching temporal logic to formalize reasoning about a class of general flow systems, including discretetime transition systems, continuoustime differential inclusions, and hybridtime systems such as hybrid automata. We introduce Full General Flow Logic, GFL which has essentially the same syntax as the wellknown Full Computation Tree Logic, CTL , but generalizes the semantics to general flow systems over arbitrary timelines. We propose an axiomatic proof system for GFL and establish its soundness w.r.t. the general flow semantics.
Lecture notes on hybrid systems
, 2004
"... The aim of this course is to introduce some fundamental concepts from the area of hybrid systems, that is dynamical systems that involve the interaction of continuous (real valued) states and discrete (finite valued) states. Applications where these types of dynamics play a prominent role will be hi ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
The aim of this course is to introduce some fundamental concepts from the area of hybrid systems, that is dynamical systems that involve the interaction of continuous (real valued) states and discrete (finite valued) states. Applications where these types of dynamics play a prominent role will be highlighted. We will introduce general methods for investigating properties such as existence of solutions, reachability and decidability of hybrid systems. The methods will be demonstrated on the motivating applications. Students who successfully complete the course should be able to appreciate the diversity of phenomena that arise in hybrid systems and how discrete “discrete ” entities and concepts such as automata, decidability and bisimulation can coexist with continuous entities and
Guaranteed Overapproximations of Unsafe Sets for Continuous and Hybrid Systems: Solving the HamiltonJacobi Equation Using Viability Techniques
 IN HYBRID SYSTEMS: COMPUTATION AND CONTROL
, 2002
"... We show how reachable sets of constrained continuous and simple hybrid systems may be computed using the minimum timetoreach function.e pre5N t an algorithm for computing a discre e approximation to the minimum timetore ach function, which we prove to be a conve rgingunde rapproximation to the a ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We show how reachable sets of constrained continuous and simple hybrid systems may be computed using the minimum timetoreach function.e pre5N t an algorithm for computing a discre e approximation to the minimum timetore ach function, which we prove to be a conve rgingunde rapproximation to the actual function.e use the discre4 minimum time69re ch function for simple hybrid syste5 to compute ove rapproximations of unsafe zon for aircraft in ase3 or of the Oakland Air Tra#c Control Cete( le ading to the automatic ge516 ation of conflictfree aircraft maneuvers.
Robust ReachAvoid Controller Synthesis for Switched Nonlinear Systems
"... Abstract — In this paper, we describe a method to automatically synthesize controllers that provide hard guarantees of safety and target reachability for sampleddata switched systems under bounded continuous disturbances. Techniques from hybrid system verification are used to perform continuous tim ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper, we describe a method to automatically synthesize controllers that provide hard guarantees of safety and target reachability for sampleddata switched systems under bounded continuous disturbances. Techniques from hybrid system verification are used to perform continuous time differential game calculations on each sampling interval. Iterative procedures are given for computing the set of states for which there exists an admissible control policy so that the closedloop system satisfies the properties of safety and reachability over a finite time horizon. From this computation, we show how to obtain an explicit state feedback policy in the form of multiple reachable sets, and an algorithm is given for using this feedback law in closedloop control of the switched system. A simulation example of automated aerial refueling is used to illustrate the application of our approach. I.
On simulations and bisimulations of general flow systems ⋆
"... Abstract. We introduce a notion of bisimulation equivalence between general flow systems, which include discrete, continuous and hybrid systems, and compare it with similar notions in the literature. The interest in the proposed notion is based on our main result, that the temporal logic GFL ⋆ – an ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce a notion of bisimulation equivalence between general flow systems, which include discrete, continuous and hybrid systems, and compare it with similar notions in the literature. The interest in the proposed notion is based on our main result, that the temporal logic GFL ⋆ – an extension to general flows of the wellknown computation tree logic CTL ⋆ – is semantically preserved by this equivalence. 1