Comparative branching-time semantics for Markov chains (extended abstract)

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

Volumn 2761, Issue , 2003, Pages 492-507

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

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; SEMANTICS; CHAINS;

BRANCHING TIME; BRANCHING TIME SEMANTICS; BRANCHING-TIME SPECTRUM; CONTINUOUS TIME MARKOV CHAIN; DISCRETE TIME; EXTENDED ABSTRACTS; WEAK BISIMULATION;

MARKOV CHAINS; MARKOV PROCESSES;

EID: 35248837304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_32     Document Type: Review

References (41)

1. L. de Alfaro. Temporal logics for the specification of performance and reliability. Symp. on Th. Aspects of Comp. Sc., LNCS 1200, pp. 165-176, 1997.
2. S. Andova and J. Baeten. Abstracion in probabilistic process algebra. Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2031, pp. 204-219, 2001.
3. A. Aziz, V. Singhal, F. Balarin, R. Brayton and A. Sangiovanni-Vincentelli. It usually works: the temporal logic of stochastic systems. CAV, LNCS 939, pp. 155-165, 1995.
4. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. Computer-Aided Verification, LNCS 1102, pp. 269-276, 1996.
5. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, University of Mannheim, 1998.
6. C. Baier, B.R. Haverkort, H. Hermanns and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. CAV, LNCS 1855, pp. 358-372, 2000.
7. C. Baier, H. Hermanns. Weak bisimulation for fully probabilistic processes. Computer-Aided Verification, LNCS 1254, pp. 119-130. 1997.
8. C. Baier, J.-P. Katoen, H. Hermanns and B. Haverkort. Simulation for continuous-time Markov chains. Concurrency Theory, LNCS 2421, pp. 338-354, 2002.
9. C. Baier, H. Hermanns, J.-P. Katoen and V. Wolf. Comparative branching-time semantics for Markov chains. Tech. Rep., Univ. of Twente, 2003.
10. C. Baier, J.-P. Katoen and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. Concurrency Theory, LNCS 1664, pp. 146-162, 1999.
11. M. Bernardo and R. Gorrieri. Extended Markovian process algebra. Concurrency Theory, LNCS 1119, pp. 315-330, 1996.
12. M. Bravetti. Revisiting interactive Markov chains. 3rd Workshop on Models for Time-Critical Systems, BRICS Notes NP-02-3, pp. 68-88, 2002.
13. M. Brown, E. Clarke, O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Th. Comp. Sc., 59: 115-131, 1988.
14. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. J. of Appl. Prob., 31: 59-75, 1994.
15. E. Clarke, O. Grumberg and D.E. Long. Model checking and abstraction. ACM Tr. on Progr. Lang. and Sys., 16(5): 1512-1542, 1994.
16. J. Desharnais. Labelled Markov Processes. PhD Thesis, McGill University, 1999.
17. J. Desharnais. Logical characterisation of simulation for Markov chains. Workshop on Probabilistic Methods in Verification, Tech. Rep. CSR-99-8, Univ. of Birmingham, pp. 33-48, 1999.
18. J. Desharnais, A. Edalat and P. Panangaden. A logical characterisation of bisimulation for labelled Markov processes. In IEEE Symp. on Logic in Comp. Sc., pp. 478-487, 1998.
19. J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. of Logic and Alg. Progr., 56: 99-115, 2003.
20. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Approximating labelled Markov processes. In IEEE Symp. on Logic in Comp. Sc., pp. 95-106, 2000.
21. J. Desharnais, V. Gupta, R. Jagadeesan and P. Panangaden. Weak bisimulation is sound and complete for PCTL*. Concurrency Theory, LNCS 2421, pp. 355-370, 2002.
22. R.J. van Glabbeek. The linear time - branching time spectrum I. The semantics of concrete, sequential processes. Ch. 1 in Handbook of Process Algebra, pp. 3-100, 2001.
23. R.J. van Glabbeek. The linear time - branching time spectrum II. The semantics of sequential processes with silent moves. Concurrency Theory, LNCS 715, pp. 66-81, 1993.
24. R.J. van Glabbeek, S.A. Smolka and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp., 121: 59-80, 1995.
25. W. Feller. An Introduction to Probability Theory and its Applications. John Wiley, 1968.
26. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp. 6: 512-535, 1994.
27. H. Hermanns. Interactive Markov Chains. LNCS 2428, 2002.
28. J. Hillston. A Compositional Approach to Performance Modelling. Cambr. Univ. Press, 1996.
29. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In IEEE Symp. on Logic in Computer Science, pp. 186-195, 1989.
30. B. Jonsson. Simulations between specifications of distributed systems. Concurrency Theory, LNCS 527, pp. 346-360, 1991.
31. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In IEEE Symp. on Logic in Comp. Sc., pp. 266-277, 1991.
32. C.-C. Jou and S.A. Smolka. Equivalences, congruences, and complete axiomatizations for probabilistic processes. Concurrency Theory, LNCS 458, pp. 367-383, 1990.
33. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Van Nostrand, 1960.
34. V.G. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, 1995.
35. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. and Comp., 94(1): 1-28, 1991.
36. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
37. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation (extended abstract). In IEEE Symp. on Logic in Comp. Sc., pp. 118-129, 1992.
38. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. Concurrency Theory, LNCS 1877, pp. 334-349, 2000.
39. M.L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
40. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic J. of Computing, 2(2): 250-273, 1995.
41. M.I.A. Stoelinga. Verification of Probabilistic, Real-Time and Parametric Systems. PhD Thesis, University of Nijmegen, 2002.