Efficient Symbolic State-Space Construction for Asynchronous Systems
- 9 June 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 103-122
- https://doi.org/10.1007/3-540-44988-4_8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Hierarchical structuring of superposed GSPNsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Reachability Set Generation and Storage Using Decision DiagramsLecture Notes in Computer Science, 1999
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Storage alternatives for large structured state spacesPublished by Springer Science and Business Media LLC ,1997
- Numerical analysis of superposed GSPNsIEEE Transactions on Software Engineering, 1996
- Compositional minimisation of finite state systems using interface specificationsFormal Aspects of Computing, 1996
- Partial-Order Methods for the Verification of Concurrent SystemsLecture Notes in Computer Science, 1996
- Exploiting symmetry in temporal logic model checkingLecture Notes in Computer Science, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986