Theoretical Computer Science
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
On-the-fly symbolic model checking for real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Distributed reachability analysis in timed automata
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
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)
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
opaal: a lattice model checker
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Multi-core LTSmin: marrying modularity and scalability
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Boosting multi-core reachability performance with shared hash tables
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Parallel recursive state compression for free
Proceedings of the 18th international SPIN conference on Model checking software
Multi-core nested depth-first search
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Parallel nested depth-first searches for LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
A note on on-the-fly verification algorithms
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
LTSMIN: distributed and symbolic reachability
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Improved multi-core nested depth-first search
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Multi-core reachability for timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in this field. We show that in general Büchi emptiness is not preserved under this abstraction, but some other structural properties are preserved. Based on those, we propose a variation of the classical nested depth-first search (ndfs) algorithm that exploits subsumption. In addition, we extend the multi-core cndfs algorithm with subsumption, providing the first parallel LTL model checking algorithm for timed automata. The algorithms are implemented in LTSmin, and experimental evaluations show the effectiveness and scalability of both contributions: subsumption halves the number of states in the real-world FDDI case study, and the multi-core algorithm yields speedups of up to 40 using 48 cores.