Comparative branching-time semantics for Markov chains

Information and Computation

Volumn 200, Issue 2, 2005, Pages 149-214

  Baier, Christel ^a   Katoen, Joost Pieter ^b,c   Hermanns, Holger ^c,d   Wolf, Verena ^e  

^a UNIVERSITY OF BONN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

^d SAARLAND UNIVERSITY   (Germany)

^e UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

(Weak) Bisimulation; (Weak) Simulation; Comparative semantics; Markov chain; Temporal logic

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FORMAL LOGIC; LINEAR PROGRAMMING; MARKOV PROCESSES; PROBABILITY; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS;

BISIMULATION; BRANCHING-TIME SPECTRUM; COMPARATIVE SEMANTICS; TEMPORAL LOGIC;

SEMANTICS;

EID: 21244460040     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2005.03.001     Document Type: Article

References (61)

1. M. Abadi, L. Lamport, The existence of refinement mappings, in: IEEE Symposium on Logic in Computer Science, 1988, pp. 165-175.
2. L. de Alfaro, Temporal logics for the specification of performance and reliability, in: Symposium on Theorical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1200, 1997, pp. 165-176.
3. S. Andova, J. Baeten, Abstraction in Probabilistic process algebra, in: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol. 2031, 2001, pp. 204-219.
4. A. Aziz, V. Singhal, F. Balarin, R. Brayton, A. Sangiovanni-Vincentelli, It usually works: the temporal logic of stochastic systems, in: Computer-Aided Verification. Lecture Notes in Computer Science, vol. 939, 1995, pp. 155-165.
5. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton Model checking continuous time Markov chains ACM Trans. Comput. Logic 1 1 2000 162 170
6. C. Baier, On algorithmic verification methods for probabilistic systems. Habilitation thesis, University of Mannheim, 1998.
7. C. Baier, B. Engelen, and M. Majster-Cederbaum Deciding bisimilarity and similarity for probabilistic processes J. Comput. System Sci. 60 1 2000 187 231
8. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen Model-checking algorithms for continuous-time Markov chains IEEE Trans. Software Eng. 29 6 2003 524 541
9. C. Baier, H. Hermanns, Weak bisimulation for fully probabilistic processes, in: Computer-Aided Verification, Lecture Notes in Computer Science, vol. 1254, 1997, pp. 119-130.
10. C. Baier, H. Hermanns, and J.-P. Katoen Probabilistic weak simulation is decidable in polynomial time Inform. Proc. Lett. 89 3 2004 123 130
11. C. Baier, H. Hermanns, J.-P. Katoen, V. Wolf, Comparative branching-time semantics for Markov chains, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 2761, 2003, pp. 492-508.
12. C. Baier, J.-P. Katoen, H. Hermanns, B. Haverkort, Simulation for continuous-time Markov chains, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 2421, 2002, 338-354.
13. C. Baier, J.-P. Katoen, H. Hermanns, Approximate symbolic model checking of continuous-time Markov chains, Concurrency Theory, Lecture Notes in Computer Science, vol. 1664, 1999, pp. 146-162.
14. C. Baier, and M.Z. Kwiatkowska Model checking for a probabilistic branching time logic with fairness Distr. Comput. 11 1998 125 155
15. M. Bernardo, R. Gorrieri, Extended Markovian process algebra, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 1119, 1996, pp. 315-330.
16. M. Bernardo, R. Cleaveland, A theory of testing for Markovian processes, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 1877, 2000, pp. 305-319.
17. M. Bravetti, Revisiting interactive Markov chains. Third Workshop on Models for Time-Critical Systems, BRICS Notes NP-02-3, 2002, pp. 68-88.
18. M. Browne, E. Clarke, and O. Grumberg Characterizing finite Kripke structures in propositional temporal logic Theor. Comput. Sc. 59 1988 115 131
19. P. Buchholz Exact and ordinary lumpability in finite Markov chains J. Appl. Prob. 31 1994 59 75
20. E. Clarke, O. Grumberg, and D.E. Long Model checking and abstraction ACM Trans. Progr. Lang. Syst. 16 5 1994 1512 1542
21. R. De Nicola, F. Vaandrager, Three logics for branching bisimulation (extended abstract), in: IEEE Symposium on Logic in Computer Science, 1992, pp. 118-129.
22. S. Derisavi, H. Hermanns, and W.H. Sanders Optimal state-space lumping in Markov chains Inform. Proc. Lett. 87 6 2003 309 315
23. J. Desharnais, Labelled Markov Processes. PhD Thesis, McGill University, 1999.
24. J. Desharnais, Logical characterisation of simulation for Markov chains, in: Workshop on Probabilistic Methods in Verification, Tech. Rep. CSR-99-8, Univ. of Birmingham, 1999, pp. 33-48.
25. J. Desharnais, A. Edalat, P. Panangaden, A logical characterisation of bisimulation for labelled Markov processes, in: IEEE Symposium on Logic in Computer Science, 1998, pp. 478-487.
26. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden Approximating labelled Markov processes Inform. Comput. 184 1 2003 160 200
27. J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Weak bisimulation is sound and complete for PCTL*, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 2421, 2002, pp. 355-370.
28. J. Desharnais, and P. Panangaden Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes J. Logic Alg. Progr. 56 2003 99 115
29. R.J. van Glabbeek, The linear time-branching time spectrum I. The semantics of concrete, sequential processes. Handbook of Process Algebra, 2001, pp. 3-100 (Chapter 1).
30. R.J. van Glabbeek, The linear time-branching time spectrum II. The semantics of sequential processes with silent moves, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 715, 1993, pp. 66-81.
31. R.J. van Glabbeek, S.A. Smolka, and B. Steffen Reactive, generative, and stratified models of probabilistic processes Inform. Comput. 121 1995 59 80
32. R.J. van Glabbeek, and W.P. Weijland Branching time and abstraction in bisimulation semantics J. ACM 43 3 1996 555 600
33. D. Gross, and D.R. Miller The randomization technique as a modeling tool and solution procedure for transient Markov chains Opin. Res. 32 2 1984 343 361
34. W. Feller An introduction to probability theory and its applications 1968 Wiley New York
35. H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Form. Asp. Comput. 6 1994 512 535
36. M.R. Henzinger, T. Henzinger, P.W. Kopke, Computing simulations on finite and infinite graphs, in: IEEE Symposium on Foundations of Computer Science, 1995, pp. 453-462.
37. H. Hermanns, Interactive Markov Chains, Lecture Notes in Computer Science, vol. 2428, 2002.
38. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle A Markov chain model checker J. Software Tools Technol. Transfer 4 2 2003 153 172
39. J. Hillston A compositional approach to performance modelling 1996 Cambridge Univ. Press Cambridge
40. T. Hyunh, and L. Tian On some equivalence relations for probabilistic processes Fund. Inform. 17 1992 211 234
41. A. Jensen Markov chains as an aid in the study of Markov processes Skand. Aktuarietidskrift 3 1953 87 91
42. C. Jones, Probabilistic Non-Determinism. Ph.D. Thesis, University of Edinburgh, 1990.
43. C. Jones, G. Plotkin, A probabilistic powerdomain of evaluations, in: IEEE Symposium on Logic in Computer Science, 1989, pp. 186-195.
44. B. Jonsson, Simulations between specifications of distributed systems, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 527, 1991, pp. 346-360.
45. C.-C. Jou, S.A. Smolka, Equivalences, congruences, and complete axiomatizations for probabilistic processes, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 458, 1990, pp. 367-383.
46. J.-P. Katoen, M.Z. Kwiatkowska, G. Norman, D. Parker, Faster and symbolic CTMC model checking, in: Process Algebra and Probabilistic Methods, Lecture Notes in Computer Science, vol. 2165, 2001, pp. 23-38.
47. J.G. Kemeny, and J.L. Snell Finite markov chains 1960 Van Nostrand
48. V.G. Kulkarni Modeling and analysis of stochastic systems 1995 Chapman and Hall London
49. K.G. Larsen, and A. Skou Bisimulation through probabilistic testing Inform. Comput. 94 1 1991 1 28
50. N.A. Lynch, and F.W. Vaandrager Forward and backward simulations: I. Untimed systems Inform. Comput. 121 2 1995 214 233
51. R. Milner, A calculus of communicating systems, in: Lecture Notes in Computer Science, vol. 92, 1980.
52. R. Milner Communication and concurrency 1989 Prentice-Hall Englewood Cliffs, NJ
53. D. Park. Concurrency and automata on infinite sequences, in: Fifth GI Conference, Lecture Notes in Computer Science, vol. 104, 1981, pp. 167-183.
54. A. Parma, and R. Segala Axiomatization of trace semantics for stochastic nondeterministic processes Quantitative evaluation of systems 2004 IEEE CS Press Silver Spring, MD 294 303
55. A. Philippou, I. Lee, O. Sokolsky, Weak bisimulation for probabilistic systems, in: Concurrency Theory, Lecture Notes in Computer Science, vol. 1877, 2000, pp. 334-349.
56. M.L. Puterman Markov decision processes: Discrete stochastic dynamic programming 1994 Wiley New York
57. R. Segala, and N.A. Lynch Probabilistic simulations for probabilistic processes Nordic J. Comput. 2 2 1995 250 273
58. M. Silva, Private communication, 1993.
59. J. Sproston, and S. Donatelli Backward stochastic bisimulation in CSL model checking Quantitative evaluation of systems 2004 IEEE CS Press Silver Spring, MD 220 229
60. W.J. Stewart Introduction to the Numerical Solution of Markov Chains 1994 Princeton University Press Princeton
61. M.I.A. Stoelinga, Verification of Probabilistic, Real-Time and Parametric Systems. PhD Thesis, University of Nijmegen, 2002.