Simulation for continuous-time Markov chains

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

Volumn 2421 LNCS, Issue , 2002, Pages 338-354

  Baier, Christel ^a   Katoen, Joost Pieter ^b   Hermanns, Holger ^b   Haverkort, Boudewijn ^c  

^a UNIVERSITY OF BONN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; STOCHASTIC SYSTEMS; CHAINS;

CONSERVATIVE EXTENSIONS; CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME MARKOV CHAIN; DISCRETE TIME MARKOV CHAINS; LIVENESS PROPERTIES; PROBABILISTIC SIMULATION; PROBABILISTIC SYSTEMS; STOCHASTIC BRANCHING;

MARKOV PROCESSES;

EID: 84874696770     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_23     Document Type: Conference Paper

References (37)

1. R. Alur, C. Courcoubetis and D. Dill. Model-checking in dense real-time. Inf. and Comp., 104(1): 2-34, 1993.
2. A. Aziz, V. Singhal, F. Balarin, R. Brayton and A. Sangiovanni- Vincentelli. It usually works: the temporal logic of stochastic systems. In P. Wolper (ed), Computer-Aided Verification, LNCS 939, pp. 155-165, 1995.
3. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. In R. Alur and T. A. Henzinger (eds), Computer-Aided Verification, LNCS 1102, pp. 269-276, 1996.
4. C. Baier, B. Engelen, and M. Majster-Cederbaum. Deciding bisimilarity and similarity for probabilistic processes. J. of Comp. and System Sc., 60(1):187-231, 2000.
5. C. Baier, B. R. Haverkort, H. Hermanns and J.-P. Katoen. On the logical characterisation of performability properties. In U. Montanari et al. (eds.), Automata, Languages, and Programming, LNCS 1853, pp. 780-792, 2000.
6. C. Baier, B. R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In E. A. Emerson and A. P. Sistla (eds), Computer-Aided Verification, LNCS 1855, pp. 358-372, 2000.
7. C. Baier, H. Hermanns. Weak bisimulation for fully probabilistic processes. In O. Grumberg (ed), Computer-Aided Verification, LNCS 1254, pp. 119-130. 1997.
8. C. Baier, J.-P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In J. C. M. Baeten and S. Mauw (eds), Concurrency Theory, LNCS 1664, pp. 146-162, 1999.
9. C. Baier, J.-P. Katoen, H. Hermanns and B. Haverkort. Simulation for continuous-time Markov chains. Technical report, Univ. Twente, 2002.
10. C. Baier and M. I. A. Stoelinga. Norm functions for probabilistic bisimulations with delays. In J. Tyurin (ed), Found. of Software Science and Computation Structures, LNCS 1784, pp. 1-16. 2000.
11. M. Bernardo and R. Cleaveland. A theory of testing for Markovian processes. In C. Palamidessi (ed), Concurrency Theory, LNCS 1877, pp. 305-319, 2000.
12. M. Brown, E. Clarke, O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Th. Comp. Sc., 59: 115-131, 1988.
13. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. J. of Appl. Prob., 31: 59-75, 1994.
14. E. Clarke, O. Grumberg and D. E. Long. Model checking and abstraction. ACM Tr. on Progr. Lang. and Sys., 16(5): 1512-1542, 1994.
15. E. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, 1999.
16. P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen. Reachability analysis of probabilistic systems by successive refinements. In L. de Alfaro and S. Gilmore (eds), Process Algebra and Probabilistic Methods, LNCS 2165, pp. 39-56, 2001.
17. J. Desharnais, A. Edalat and P. Panangaden. A logical characterisation of bisimulation for labelled Markov processes. In IEEE Symp. on Logic in Computer Science, pp. 478-487, 1998.
18. J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes, 2001 (submitted for publication). (available at http://www-acaps.cs.mcgill.ca/~prakash/csl.ps).
19. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Approximating labelled Markov processes. In IEEE Symp. on Logic in Computer Science, pp. 95-106, 2000.
20. R. J. van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics. J. ACM, 43(3): 555-600, 1996.
21. D. Gross and D. R. Miller. The randomization technique as a modeling tool and solution procedure for transient Markov chains. Oper. Res. 32(2): 343-361, 1984.
22. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp. 6: 512-535, 1994.
23. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. In S. Graf and M. Schwartzbach (eds), Tools and Algs. for the Construction and Analysis of Systems, LNCS 1785, pp. 347-362, 2000.
24. A. Jensen. Markov chains as an aid in the study of Markov processes. Skand. Aktuarietidskrift 3: 87-91, 1953.
25. B. Jonsson. Simulations between specifications of distributed systems. In J. C. M. Baeten and J. F. Groote (eds), Concurrency Theory, LNCS 527, pp. 346-360, 1991.
26. B. Jonsson and K. G. Larsen. Specification and refinement of probabilistic processes. In IEEE Symp. on Logic in Computer Science, pp. 266-277, 1991.
27. B. Jonsson, W. Yi and K. G. Larsen. Probabilistic extensions of process algebras. In J. Bergstra et al. (eds), Handbook of Process Algebra, Ch. 11, pp. 685-709, 2001.
28. J.-P. Katoen, M. Z. Kwiatkowska, G. Norman and D. Parker. Faster and symbolic CTMC model checking. In L. de Alfaro and S. Gilmore (eds), Process Algebra and Probabilistic Methods, LNCS 2165, pp. 23-38, 2001.
29. V. G. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, 1995.
30. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. and Comp., 94(1): 1-28, 1992.
31. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
32. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In C. Palamidessi (ed), Concurrency Theory, LNCS 1877, pp. 334-349, 2000.
33. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
34. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. Nordic J. of Computing, 2(2): 250-273, 1995.
35. M. Silva. Private communication. 1993.
36. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press, 1994.
37. M. I. A. Stoelinga. Verification of Probabilistic, Real-Time and Parametric Systems. PhD Thesis, University of Nijmegen, 2002.