Efficient emptiness check for timed Büchi automata
- 24 December 2011
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 40 (2) , 122-146
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- How to stop time stoppingFormal Aspects of Computing, 2006
- Lower and upper bounds in zone-based abstractions of timed automataInternational Journal on Software Tools for Technology Transfer, 2005
- On-the-Fly Emptiness Checks for Generalized Büchi Automata2005
- Analysing the PGM protocol with UPPAALInternational Journal of Production Research, 2004
- Forward Analysis of Updatable Timed AutomataFormal Methods in System Design, 2004
- Untameable Timed Automata!2003
- Kronos: A model-checking tool for real-time systems1998
- Model checking of real-time reachability properties using abstractions1998
- A theory of timed automataTheoretical Computer Science, 1994
- Timing assumptions and verification of finite-state concurrent systems1990