Approximative Symbolic Model Checking of Continuous-Time Markov Chains
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 146-161
- https://doi.org/10.1007/3-540-48320-9_12
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Automated compositional Markov chain generation for a plain-old telephone systemScience of Computer Programming, 2000
- Model checking for a probabilistic branching time logic with fairnessDistributed Computing, 1998
- Polytime model checking for timed probabilistic computation tree logicActa Informatica, 1998
- Model checking large software specificationsIEEE Transactions on Software Engineering, 1998
- Symbolic model checking for probabilistic processesPublished by Springer Nature ,1997
- 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
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Probabilistic VerificationInformation and Computation, 1993
- Composite performance and dependability analysisPerformance Evaluation, 1992