Symbolic model checking for probabilistic processes
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 430-440
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Polynomial time algorithms for testing probabilistic bisimulation and simulation1996
- Multi-Terminal Binary Decision Diagrams and Hybrid Decision Diagrams1996
- The complexity of probabilistic verificationJournal of the ACM, 1995
- VerusACM SIGPLAN Notices, 1995
- Model Checking of Probabilistic and Nondeterministic Systems1995
- Spectral transforms for large boolean functions with applications to technology mapping1993
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Verifying temporal properties of finite-state probabilistic programs1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Automatic verification of finite state concurrent system using temporal logic specifications1983