Pushdown timed automata: a binary reachability characterization and safety verification
- 13 June 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 302 (1-3) , 93-121
- https://doi.org/10.1016/s0304-3975(02)00743-0
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A theory of timed automataPublished by Elsevier ,2002
- Specification of realtime systems using ASTRALIEEE Transactions on Software Engineering, 1997
- A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)Electronic Notes in Theoretical Computer Science, 1997
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARSInternational Journal of Foundations of Computer Science, 1996
- The benefits of relaxing punctualityJournal of the ACM, 1996
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- A really temporal logicJournal of the ACM, 1994
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- Real-Time Logics: Complexity and ExpressivenessInformation and Computation, 1993
- The complexity of decision problems for finite-turn multicounter machinesJournal of Computer and System Sciences, 1981