Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Refinements of approximation automata for synthesis of supervisory controllers for hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Invariance of Approximating Automata for Piecewise Linear Systems with Uncertainties
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Observability of hybrid automata by abstraction
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
| Hi-index | 0.00 |
Approximating automata are finite-state representations of the sequential input-output behaviors of hybrid systems characterized by threshold events that trigger discrete changes in the continuous dynamic equations. Procedures proposed for constructing approximating automata require forward and backward mappings of sets of continuous state trajectories - mappings which are not available for arbitrary continuous dynamics. This paper develops the foundations for constructing approximating automata automatically for hybrid systems in which the continuous dynamics are defined by convex polytopes in the vector space of the derivatives of the continuous state trajectories. The computations are illustrated for a simple example which also demonstrates the use of approximating automata to solve verification problems that may be intractable using fixed-point computations for linear hybrid automata.