Weak bisimulation for probabilistic systems

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

Volumn 1877 LNCS, Issue , 2000, Pages 334-349

  Philippou, Anna ^a   Lee, Insup ^b   Sokolsky, Oleg ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; POLYNOMIAL APPROXIMATION;

COMPUTATION TREES; INFINITE NUMBERS; NONDETERMINISTIC BEHAVIOR; POLYNOMIAL TIME COMPLEXITY; PROBABILISTIC SYSTEMS; PROBABILISTIC TRANSITION SYSTEM; TRANSITION SYSTEM; WEAK BISIMULATION;

POLYNOMIAL APPROXIMATION; MARKOV PROCESSES;

EID: 84885212224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_25     Document Type: Conference Paper

References (30)

1. J. Baeten and J. Klop, editors. Proceedings CONCUR 90, Amsterdam, Volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
2. C. Baier. Polynomial time algorithms for testing probabilistic bisimulation and simulation. In R. Alur and T. Henzinger, editors, Proceedings of the 8th International Conference on Computer Aided Verification, New Brunswick, NJ, USA, Volume 1102 of Lecture Notes in Computer Science, pages 38-49. Springer-Verlag July/August 1996.
3. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Proceedings of the 9th International Conference on Computer Aided Verification, Haifa, Volume 1254 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
4. th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, August 1997.
5. C. Baier and M. Stoelinga. Norm functions for bisimulations with delays. In Proc. FOSSACS'00. Springer-Verlag, 2000.
6. M. Bernardo and R. Gorrieri. Extended markovian process algebra. In U. Monta-nari and V. Sassone, editors, Proceedings CONCUR'96, Pisa, Italy, Volume 1119 of Lecture Notes in Computer Science, pages 315-330. Springer-Verlag, 1996.
7. A. Bianco and R. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proceedings Foundations of Software Techonology ans Theoretical Computer Science, Volume 1026 of Lecture Notes in Computer Science, pages 499-513. Springer-Verlag, 1995.
8. I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Baeten and Klop [1], pages 126-140.
9. L. Christoff and I. Christoff. Efficient algorithms for verification of equivalences of probabilistic processes. In K. Larsen and A. Skou, editors, Proceedings of the 3rd International Workshop on Computer Aided Verification, Aalborg, Denmark, Volume 575 of Lecture Notes in Computer Science, pages 310-321. Springer-Verlag, 1991.
10. th ICALP, Vienna, Volume 623 of Lecture Notes in Computer Science, pages 708-719. Springer-Verlag, 1992.
11. th Annual Symposium on Foundations of Computer Science, pages 338-345. IEEE, 1988.
12. th ICALP, Warwick, Volume 443 of Lecture Notes in Computer Science, pages 336-349. Springer-Verlag, July 1990.
13. th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 130-141. IEEE Computer Society Press, 1990.
14. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Systems, Uppsala University, 1991. DoCS 91/27.
15. J. Hillston. PEPA: Performance enhanced process algebra. Technical Report CSR-24-93, University of Edinburgh, UK, 1993.
16. B. Jonsson, C. Ho-Stuart, and W. Yi. Testing and refinement for nondeterministic and probabilistic processes. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Proceedings of the Third International School and Symposium on Formal Techniques in Real Time and Fault Tolerant Systems (FTRTFT'94), Lübeck, Germany, September 1994, Volume 863 of Lecture Notes in Computer Science, pages 418-430. Springer-Verlag, 1994.
17. th Annual Symposium on Logic in Computer Science, Amsterdam, pages 266-277. IEEE Computer Society Press, 1991.
18. C. Jou and S. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes. In Baeten and Klop [1].
19. P. Kanellakis and S. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1): 43-68, May 1990.
20. H. Karloff. Linear Programming. Progress in Theoretical Computer Science. Birkhauser, 1991.
21. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94, 1991.
22. I. Lee, P. Brémond-Grégoire, and R. Gerber. A process algebraic approach to the specification and analysis of resource-bound real-time systems. Proceedings of the IEEE, pages 158-171, Jan 1994.
23. R. Milner. Communication and Concurrency. Prentice-Hall International, Engle-wood Cliffs, 1989.
24. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6): 973-989, 1987.
25. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. Technical report, University of Cyprus, 1999.
26. A. Philippou, O. Sokolsky, R. Cleaveland, I. Lee, and S. Smolka. Probabilistic resource failure in real-time process algebra. In D. Sangiorgi and R. de Simone, editors, Proceedings CO NC UR 98, Nice, France, Volume 1446 of Lecture Notes in Computer Science, pages 389-404. Springer-Verlag, 1998.
27. A. Pnueli and L. Zuck. Probabilistic verification. Information and Computation, 103: 1-29, 1993.
28. R. Segala. Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1995.
29. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proceedings CONCUR 94, Uppsala, Sweden, Volume 836 of Lecture Notes in Computer Science, pages 481-496. Springer-Verlag, 1994.
30. th Annual Symposium on Foundations of Computer Science, pages 327-338. IEEE, 1985.