Implicit GSPN reachability set generation using decision diagrams
- 1 March 2004
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 56 (1-4) , 145-165
- https://doi.org/10.1016/j.peva.2003.07.005
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Saturation UnboundPublished by Springer Nature ,2003
- Saturation: An Efficient Iteration Strategy for Symbolic State—Space GenerationPublished by Springer Nature ,2001
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov ModelsINFORMS Journal on Computing, 2000
- Discrete-Time Markovian Stochastic Petri NetsPublished by Springer Nature ,1995
- Generalized stochastic Petri nets: a definition at the net level and its implicationsIEEE Transactions on Software Engineering, 1993
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Compiling Techniques for the Analysis of Stochastic Petri NetsPublished by Springer Nature ,1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systemsACM Transactions on Computer Systems, 1984