Series of Abstractions for Hybrid Automata
- 14 March 2002
- book chapter
- Published by Springer Nature
- p. 465-478
- https://doi.org/10.1007/3-540-45873-5_36
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computing simulations on finite and infinite graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Discrete abstractions of hybrid systemsProceedings of the IEEE, 2000
- Modular Specification of Hybrid Systems in CharonPublished by Springer Nature ,2000
- Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe ApproximationsPublished by Springer Nature ,1999
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- Algorithmic analysis of nonlinear hybrid systemsIEEE Transactions on Automatic Control, 1998
- Hybrid automata with finite bisimulationsPublished by Springer Nature ,1995
- Hybrid automata: An algorithmic approach to the specification and verification of hybrid systemsPublished by Springer Nature ,1993
- An approach to the description and analysis of hybrid systemsPublished by Springer Nature ,1993
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975