Model checking CSL until formulae with random time bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2399, Issue , 2002, Pages 152-168

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Pacheco, António ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER CIRCUITS; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; RANDOM VARIABLES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

COMPUTATIONAL COSTS; CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME MARKOV CHAIN; DEPENDABILITY ANALYSIS; DISTRIBUTED DELAYS; GAMMA DISTRIBUTION; PROBABILITY THRESHOLD; TRANSIENT PROPERTY;

MODEL CHECKING;

EID: 23844460723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45605-8_10     Document Type: Conference Paper

References (20)

1. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In Proc. CAV’96, volume 1102 of LNCS, pages 269-276. Springer, 1996.
2. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model checking continuous time Markov chains. ACM Transactions on Computational Logic, 1(1):162-170, 2000.
3. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc. CAV 2000, volume 1855 of LNCS, pages 358-372, 2000.
4. C. Baier, J.-P. Katoen, and H. Hermanns. Approximative symbolic model checking of continuous-time Markov chains. In Proc. CONCUR’99, volume 1664 of LNCS, pages 146-162. Springer, 1999.
5. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
6. M. Crovella and A. Bestavros. Self-similarity in world wide Web traffic: evidence and possible causes. IEEE/ACM Transactions on Networking, 5(6):835-846, 1997.
7. B. Fox and P. Glynn. Computing Poisson probabilities. Communications of the ACM, 31(4):440-445, 1988.
8. R. German. Performance Analysis of Communication Systems: Modeling with Non-Markovian Stochastic Petri Nets. John Wiley and Sons, 2000.
9. J. Grandell. Mixed Poisson Processes. Chapman & Hall, 1997.
10. D. Gross and D. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research, 32(2):343-361, 1984.
11. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6:512-535, 1994.
12. A. Jensen. Markov chains as an aid in the study of Markov processes. Skandinavisk Aktuarietidsskrift, Marts, pages 87-91, 1953.
13. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In Proc. PAPM-PROBMIV 2001, volume 2165 of LNCS, pages 23-38. Springer, 2001.
14. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In Proc. TACAS 2002, volume 2280 of LNCS, pages 52-66. Springer, 2002.
15. G.I. Lópes, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions. In Proc PAPM-PROBMIV 2001, volume 2165 of LNCS, pages 57-70. Springer, 2001.
16. S. Molnár and I. Maricza, editors. Source characterization in broadband networks. COST 257 Mid-term seminar interim report on source characterization, 2000.
17. J. Muppala and K. Trivedi. Queueing Systems, Queueing and Related Models, chapter Numerical Transient Solution of Finite Markovian Queueing Systems, pages 262-284. Oxford University Press, 1992.
18. H. Panjer. Recursive evaluation of a family of compound distributions. Astin Bulletin, 12(1):22-26, 1982.
19. PRISM web page. http://www.cs.bham.ac.uk/~dxp/prism/.
20. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.