The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Linear phase-portrait approximations for nonlinear 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
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Verification of Hybrid Systems: Formalization and Proof Rules in PVS
ICECCS '01 Proceedings of the Seventh International Conference on Engineering of Complex Computer Systems
Information and Computation
Automatic rectangular refinement of affine hybrid systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Towards component based design of hybrid systems: safety and stability
Time for verification
| Hi-index | 0.00 |
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that systems are frequently designed and verified in a modular approach, it is desirable that this relationship is compositional, which is not the case for hybrid systems in general. We identify subclasses of linear hybrid automata that are compositional with respect to timed, respectively weak timed simulation.