Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 395-410
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Approximative Symbolic Model Checking of Continuous-Time Markov Chains1999
- From Fairness to ChanceElectronic Notes in Theoretical Computer Science, 1999
- Model checking for a probabilistic branching time logic with fairnessDistributed Computing, 1998
- Algebraic Decision Diagrams and Their ApplicationsFormal Methods in System Design, 1997
- Symbolic model checking for probabilistic processes1997
- Markovian analysis of large finite state machinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- The complexity of probabilistic verificationJournal of the ACM, 1995
- Model checking of probabilistic and nondeterministic systems1995
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Automatic verification of finite state concurrent system using temporal logic specifications1983