Weak bisimulation is sound and complete for PCTL

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

Volumn 2421 LNCS, Issue , 2002, Pages 355-370

  Desharnais, Josée ^a   Gupta, Vineet ^b   Jagadeesan, Radha ^c   Panangaden, Prakash ^d  

^a UNIVERSITÉ LAVAL   (Canada)

^b Stratify Inc   (United States)

^c Loyola University Lake Shore Campus ^*  (United States)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVITY; AXIOMATIZATION; BISIMULATIONS; FINITE STATE; FINITE STATE SYSTEMS; LINEAR COMBINATIONS; NON-DETERMINISM; PROBABILISTIC SYSTEMS; SOUND AND COMPLETE; WEAK BISIMULATION;

PROBABILITY DISTRIBUTIONS; MARKOV PROCESSES; PROBABILISTIC LOGICS;

MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

EID: 84874739738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. It usually works: the temporal logic of stochastic systems. In Proceedings of the Conference on Computer-Aided Verification, number 939 in Lecture Notes In Computer Science. Springer-Verlag, 1995.
2. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Proceedings of the 1997 International Conference on Computer Aided Verification, number 1254 in Lecture Notes In Computer Science. Springer-Verlag, 1997.
3. E. Bandini and R. Segala. Axiomatizations for probabilistic bisimulation. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, number 2076 in Lecture Notes In Computer Science, pages 370-381. Springer-Verlag, July 2001.
4. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labelled Markov processes. In Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 1997.
5. G. Choquet. Theory of capacities. Ann. Inst. Fourier (Grenoble), 5:131-295, 1953.
6. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
7. C. Dellacherie. Capacités et Processus Stochastiques. Springer-Verlag, 1972.
8. J. Desharnais, A. Edalat, and P. Panangaden. A logical characterization of bisimulation for labeled Markov processes. In proceedings of the 13th IEEE Symposium On Logic In Computer Science, Indianapolis, pages 478-489. IEEE Press, June 1998.
9. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 2002.
10. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Metrics for labeled Markov processes. In Jos Baeten and Sjouke Mauw, editors, Proceedings of CON-CUR99, number 1664 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
11. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for labelled Markov processes. In Proceedings of the Seventeenth Annual IEEE Symposium On Logic In Computer Science, July 2002.
12. J. Desharnais and P. Panangaden. Continuous stochastic logic characterizes bisimulation for continuous-time markov processes. Available from http://www-acaps.cs.mcgill.ca/~prakash/pubs.html, 2001.
13. Hans A. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-time Safety-critical Systems. Elseiver, 1994.
14. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, 1960.
15. K. G. Larsen and A. Skou. Bisimulation through probablistic testing. Information and Computation, 94:1-28, 1991.
16. P. A. Meyer. Probability and Potentials. Blaisdell, 1966.
17. A. Philippou, I. Lee, and O. Sokolsky. Weal bisimulation for probabilistic processes. In C. Palamidessi, editor, Proceedings of CONCUR 2000, number 1877 in Lecture Notes In Computer Science, pages 334-349. Springer-Verlag, 2000.
18. D. Schmeidler. Subjective probability without additivity. Technical report, Foerder Institute of Economic Research, 1984.
19. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1995. Also appears as technical report MIT/LCS/TR-676.
20. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proceedings of CONCUR94, number 836 in Lecture Notes In Computer Science, pages 481-496. Springer-Verlag, 1994.