Logical characterizations of bisimulations for discrete probabilistic systems

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

Volumn 4423 LNCS, Issue , 2007, Pages 287-301

  Parma, Augusto ^a   Segala, Roberto ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

BISIMULATION RELATIONS; DISCRETE PROBABILISTIC SYSTEMS; PROBABILISTIC AUTOMATA; REACTIVE SYSTEMS;

FINITE AUTOMATA;

EID: 37149049352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_21     Document Type: Conference Paper

References (16)

1. M. Bravetti and P.R. D'Argenio. Tutte le algebre insieme: Concepts, discussions and relations of stochastic process algebras with general distributions. In B Haverkort et al, editor, Proc. of GI/Dagstuhl Research Seminar Validation of Stochastic Systems, Dagstuhl Germany, volume 2925 of Lecture Notes in Computer Science, pages 44-88. Springer, 2004.
2. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In P. Jankar and M. Kretinsky, editors, Proceedings of CONCUR 2002, Brno, Czech Republic, volume 2421 of Lecture Notes in Computer Science, pages 371-385. Springer-Verlag, 2002.
3. Y. Deng. Axiomatisations and Types for Probabilistic and Mobile Processes. PhD thesis, Ecole des Mines de Paris, 2005.
4. J. Desharnais, A. Edalat, and P. Panangaden. A logical chracterization of bisimulation for labelled markov processes. Proceedings of the 13th IEEE Symposium On Logic In Computer Science, 179(2) :478-489, 1998.
5. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Weak bisimulation is sound and complete for PCTL. In M. Ketnsky L. Brim, P. Janar and A. Kuera, editors, Proc. CONCUR 2002, volume 2421 of LNCS, pages 355-370, 2002.
6. th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 130-141. IEEE Computer Society Press, 1990.
7. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, 1991.
8. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137-161, 1985.
9. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, July 1991.
10. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
11. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In C. Palamidessi, editor, Proceedings of CONCUR 2000, University Park, PA, USA, volume 1877 of Lecture Notes in Computer Science, pages 334-349. SpringerVerlag, 2000.
12. 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.
13. R. Segala. Probability and nondeterminism in operational models for concurrency. In Proceedings of CONCUR '2006, volume 4137 of Lecture Notes in Computer Science, pages 64-78. Springer-Verlag, 2006.
14. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
15. R. Segala and A. Turrini. Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In Proceedings of QEST 2005, September 2005.
16. A. Sokolova and E.P. de Vink. Probabilistic automata: system types, parallel composition and comparison. In C. Baier, B.R. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors, Validation of Stochastic Systems: A Guide to Current Research, pages 1-43. LNCS 2925, 2004.