Introduction to algorithms
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Forward and backward simulations II.: timing-based systems
Information and Computation
Verification of automated vehicle protection systems (extended abstract)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Studies in hybrid systems: modeling, analysis, and control
Studies in hybrid systems: modeling, analysis, and control
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
State Equivalences for Rectangular Hybrid Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Verification of an Audio Protocol with Bus Collision Using UPPAAL
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Correctness of vehicle control systems-a case study
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
High-Level Modeling and Analysis of TCAS
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Information and Computation
SIAM Journal on Control and Optimization
Brief paper: Input-to-state stability of switched systems and switching adaptive control
Automatica (Journal of IFAC)
A verification framework for hybrid systems
A verification framework for hybrid systems
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Safety verification of an aircraft landing protocol: a refinement approach
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Trace-based semantics for probabilistic timed I/O automata
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Proceedings of the 6th international conference on Hybrid systems: computation and control
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Safety verification of model helicopter controller using hybrid input/output automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Proceedings of the 9th international conference on Hybrid Systems: computation and control
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Proceedings of the 8th international conference on Hybrid Systems: computation and control
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Brief Hysteresis-based switching algorithms for supervisory control of uncertain systems
Automatica (Journal of IFAC)
Synthesizing switching logic for safety and dwell-time requirements
Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
Composing reachability analyses of hybrid systems for safety and stability
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Automatica (Journal of IFAC)
Lyapunov abstractions for inevitability of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
| Hi-index | 0.00 |
Average dwell time (ADT) properties characterize the rate at which a hybrid system performs mode switches. In this article, we present a set of techniques for verifying ADT properties. The stability of a hybrid system A can be verified by combining these techniques with standard methods for checking stability of the individual modes of A. We introduce a new type of simulation relation for hybrid automata—switching simulation—for establishing that a given automaton A switches more rapidly than another automaton B. We show that the question of whether a given hybrid automaton has ADT τa can be answered either by checking an invariant or by solving an optimization problem. For classes of hybrid automata for which invariants can be checked automatically, the invariant-based method yields an automatic method for verifying ADT; for automata that are outside this class, the invariant has to be checked using inductive techniques. The optimization-based method is automatic and is applicable to a restricted class of initialized hybrid automata. A solution of the optimization problem either gives a counterexample execution that violates the ADT property, or it confirms that the automaton indeed satisfies the property. The optimization and the invariant-based methods can be used in combination to find the unknown ADT of a given hybrid automaton.