Theoretical Computer Science
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Lower and upper bounds in zone-based abstractions of timed automata
International Journal on Software Tools for Technology Transfer (STTT)
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Formal Aspects of Computing
REDLIB for the Formal Verification of Embedded Systems
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Checking timed Büchi automata emptiness on simulation graphs
ACM Transactions on Computational Logic (TOCL)
Checking Timed Büchi Automata Emptiness Using LU-Abstractions
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Efficient detection of Zeno runs in timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Efficient emptiness check for timed büchi automata
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Efficient emptiness check for timed Büchi automata
Formal Methods in System Design
| Hi-index | 0.00 |
An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno. Over the years important improvements have been obtained in checking reachability properties for timed automata. We show that some of these very efficient optimizations make testing for Zeno runs costly. In particular we show NP-completeness for the LU-extrapolation of Behrmann et al. We analyze the source of this complexity in detail and give general conditions on extrapolation operators that guarantee a (low) polynomial complexity of Zenoness checking. We propose a slight weakening of the LU-extrapolation that satisfies these conditions.