An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Multiple State and Single State Tableaux for Combining Local and Global Model Checking
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Analysis of Symbolic SCC Hull Algorithms
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Is There a Best Symbolic Cycle-Detection Algorithm?
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Stutter-Invariant Languages, omega-Automata, and Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Emptiness Check of Powerset Buchi Automata using Inclusion Tests
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Hierarchical Set Decision Diagrams and Automatic Saturation
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Hierarchical Set Decision Diagrams and Regular Models
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the 14th international SPIN conference on Model checking software
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Strength-Based decomposition of the property Büchi automaton for faster model checking
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed product is an explicit graph of aggregates (symbolic sets of states) that can be interpreted as a Büchi automaton. The criterion used by SLAP to aggregate states from the Kripke structure is based on the analysis of self-loops that occur in the Büchi automaton expressing the property to verify. Our hybrid approach allows on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the other hand, to have a compact encoding of the state space thanks to the symbolic representation of the aggregates. Our experiments show that this technique often outperforms other existing (hybrid or fully symbolic) approaches.