Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 395-410
- https://doi.org/10.1007/3-540-46419-0_27
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Markov decision processes and regular eventsPublished by Springer Nature ,2005
- A data structure for the efficient Kronecker solution of GSPNsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- From Fairness to ChanceElectronic Notes in Theoretical Computer Science, 1999
- Approximative Symbolic Model Checking of Continuous-Time Markov ChainsPublished by Springer Nature ,1999
- Model checking for a probabilistic branching time logic with fairnessDistributed Computing, 1998
- Symbolic model checking for probabilistic processesPublished by Springer Nature ,1997
- Algebric Decision Diagrams and Their ApplicationsFormal Methods in System Design, 1997
- The complexity of probabilistic verificationJournal of the ACM, 1995
- Model checking of probabilistic and nondeterministic systemsPublished by Springer Nature ,1995
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983