Saturation: An Efficient Iteration Strategy for Symbolic State—Space Generation
- 23 March 2001
- book chapter
- Published by Springer Nature
- p. 328-342
- https://doi.org/10.1007/3-540-45319-9_23
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Efficient Symbolic State-Space Construction for Asynchronous SystemsPublished by Springer Nature ,2000
- Symbolic Reachability Analysis Based on SAT-SolversPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- NuSMV: A New Symbolic Model VerifierLecture Notes in Computer Science, 1999
- Partial-order reduction in symbolic state space explorationPublished by Springer Nature ,1997
- Partial model checking with ROBDDsPublished by Springer Nature ,1997
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986