Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The saturation algorithm for symbolic state-space exploration
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Logic and stochastic modeling with SMART
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Exploiting interleaving semantics in symbolic state-space generation
Formal Methods in System Design
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Symbolic computation of strongly connected components and fair cycles using saturation
Innovations in Systems and Software Engineering
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
| Hi-index | 0.00 |
The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivated by efficiently applying saturation to CTL model checking. First, we introduce a new "constrained saturation" algorithm which constrains state exploration to a set of states satisfying given properties. This algorithm avoids the expensive after-the-fact intersection operations and retains the advantages of saturation, namely, exploiting event locality and benefiting from recursive local fixpoint computations. Then, we employ constrained saturation to build the set of states satisfying EU and EG properties for asynchronous systems. The new algorithm can achieve orders-of-magnitude reduction in runtime and memory consumption with respect to methods based on breath-first search, and even with a previously-proposed hybrid approach that alternates between "safe" saturation and "unsafe" breadth-first searches. Furthermore, the new approch is fully general, as it does not require the next-state function to be expressable in Kronecker form. We conclude this paper with a discussion of some possible future work, such as building the set of states belonging to strongly connected components.