The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Verifying clocked transition systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Model checking
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
The power of reachability testing for timed automata
Theoretical Computer Science
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)
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Checking timed Büchi automata emptiness on simulation graphs
ACM Transactions on Computational Logic (TOCL)
Static guard analysis in timed automata verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Coarse abstractions make zeno behaviours difficult to detect
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Efficient emptiness check for timed Büchi automata
Formal Methods in System Design
Multi-core emptiness checking of timed Büchi automata using inclusion abstraction
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper shows that the zone-based LU-extrapolation of Behrmann et al, that preserves reachability of timed automata, also preserves emptiness of timed Büchi automata. This improves the previous results by Tripakis et al who showed that the k -extrapolation preserves timed Büchi automata emptiness. The LU-extrapolation is coarser than k -extrapolation, allowing better state space reductions. A tool with LU-extrapolation for emptiness checking of timed Büchi automata has been implemented, and some experiments are reported.