Timing assumptions and verification of finite-state concurrent systems
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 197-212
- https://doi.org/10.1007/3-540-52148-8_17
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The complementation problem for Büchi automata with applications to temporal logicPublished by Springer Nature ,2005
- Combining CTL, trace theory and timing modelsPublished by Springer Nature ,1990
- Automated verification of timed transition modelsPublished by Springer Nature ,1990
- Specifying, programming and verifying real-time systems using a synchronous declarative languagePublished by Springer Nature ,1990
- In Transition From Global to Modular Temporal Reasoning about ProgramsPublished by Springer Nature ,1985
- Automata theoretic techniques for modal logics of programsPublished by Association for Computing Machinery (ACM) ,1984
- Real-time programming and asynchronous message passingPublished by Association for Computing Machinery (ACM) ,1983
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970