Hybrid automata with finite bisimulations
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 324-335
- https://doi.org/10.1007/3-540-60084-1_85
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Automatic symbolic verification of embedded systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verifying programs with unreliable channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- What's decidable about hybrid automata?Published by Association for Computing Machinery (ACM) ,1995
- Algorithmic analysis of nonlinear hybrid systemsPublished by Springer Nature ,1995
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- Verification of linear hybrid systems by means of convex approximationsPublished by Springer Nature ,1994
- A calculus of durationsInformation Processing Letters, 1991
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990