Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking
- 14 January 2022
- book chapter
- Published by Springer Nature
- p. 151-173
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- More efficient on-the-fly LTL verification with Tarjan's algorithmTheoretical Computer Science, 2005
- Using partial orders to improve automatic verification methods2005
- Symmetry reductions in model checking1998
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- A stubborn attack on state explosionFormal Methods in System Design, 1992
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972