Model Checking CSL until Formulae with Random Time Bounds
- 4 July 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 152-168
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Probabilistic Symbolic Model Checking with PRISM: A Hybrid ApproachLecture Notes in Computer Science, 2002
- Faster and Symbolic CTMC Model Checking2001
- Model-checking continuous-time Markov chainsACM Transactions on Computational Logic, 2000
- Model Checking Continuous-Time Markov Chains by Transient Analysis2000
- Approximative Symbolic Model Checking of Continuous-Time Markov Chains1999
- Self-similarity in World Wide Web traffic: evidence and possible causesIEEE/ACM Transactions on Networking, 1997
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Computing Poisson probabilitiesCommunications of the ACM, 1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Markoff chains as an aid in the study of Markoff processesScandinavian Actuarial Journal, 1953