Reachability Analysis of Probabilistic Systems by Successive Refinements
- 30 August 2001
- book chapter
- Published by Springer Nature
- p. 39-56
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Tools and Algorithms for the Construction and Analysis of SystemsLecture Notes in Computer Science, 2000
- ProbVerus: Probabilistic Symbolic Model Checking1999
- Approximative Symbolic Model Checking of Continuous-Time Markov Chains1999
- Algebraic Decision Diagrams and Their ApplicationsFormal Methods in System Design, 1997
- Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix RepresentationFormal Methods in System Design, 1997
- The bounded retransmission protocol must be on time!1997
- Model checking of probabilistic and nondeterministic systems1995
- It usually works: The temporal logic of stochastic systems1995
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Minimal state graph generationScience of Computer Programming, 1992