The power of reachability testing for timed automata
- 7 May 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 300 (1-3) , 411-475
- https://doi.org/10.1016/s0304-3975(02)00334-1
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Is your model checker on time? On the complexity of model checking for timed modal logicsThe Journal of Logic and Algebraic Programming, 2002
- A theory of timed automataPublished by Elsevier ,2002
- The Power of Reachability Testing for Timed AutomataPublished by Springer Nature ,1998
- Model Checking via Reachability Testing for Timed AutomataBRICS Report Series, 1997
- UPPAAL — a tool suite for automatic verification of real-time systemsPublished by Springer Nature ,1996
- Bisimulation can't be tracedJournal of the ACM, 1995
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- Quantales, observational logic and process semanticsMathematical Structures in Computer Science, 1993
- Minimum and maximum delay problems in real-time systemsFormal Methods in System Design, 1992
- Testing equivalences for processesTheoretical Computer Science, 1984