Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
The hierarchical lattices of a finite machine
Systems & Control Letters
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Deciding reachability for planar multi-polynomial systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
A shorter model theory
Hybrid Systems I
Hybrid Systems II
Hybrid Systems IV
Proceedings of the International Workshop on Hybrid and Real-Time Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Subanalytic Stratifications and Bisimulations
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
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
Distributed Lyapunov Functions in Analysis of Graph Models of Software
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Bisimilar Finite Abstractions of Interconnected Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Discrete-State Abstractions of Nonlinear Systems Using Multi-resolution Quantizer
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Modeling, optimization and computation for software verification
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Bisimulation for communicating piecewise deterministic markov processes (CPDPs)
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
| Hi-index | 0.00 |
The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructing finite, reachability preserving quotient systems called bisimulations. In this paper, we use recent results from stratification theory, subanalytic sets, and model theory in order to extend the state-of-the-art results on the existence of bisimulations for certain classes of planar hybrid systems.