The saturation algorithm for symbolic state-space exploration
- 9 November 2005
- journal article
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 8 (1) , 4-25
- https://doi.org/10.1007/s10009-005-0188-7
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Compositional minimization of finite state systemsPublished by Springer Nature ,2005
- A stubborn attack on state explosionPublished by Springer Nature ,2005
- Structural Symbolic CTL Model Checking of Asynchronous SystemsPublished by Springer Nature ,2003
- Blockwise variable orderings for shared BDDsPublished by Springer Nature ,1998
- Compositional state space generation from Lotos programsPublished by Springer Nature ,1997
- Storage alternatives for large structured state spacesPublished by Springer Nature ,1997
- Compositional minimisation of finite state systems using interface specificationsFormal Aspects of Computing, 1996
- A decomposition approach for stochastic reward net modelsPerformance Evaluation, 1993
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- On the stochastic structure of parallelism and synchronization models for distributed algorithmsACM SIGMETRICS Performance Evaluation Review, 1985