Decision algorithms for probabilistic bisimulation

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

Volumn 2421 LNCS, Issue , 2002, Pages 371-386

  Cattani, Stefano ^a   Segala, Roberto ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; POLYNOMIAL APPROXIMATION;

BISIMULATION RELATIONS; DECISION ALGORITHMS; NONDETERMINISTIC SYSTEMS; POLYNOMIAL TIME COMPLEXITY; PROBABILISTIC AUTOMATA; PROBABILISTIC BISIMULATIONS; WEAK BISIMULATION;

POLYNOMIAL APPROXIMATION; ALGORITHMS;

EID: 84874725869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_25     Document Type: Conference Paper

References (25)

1. L. d. Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Available as Technical report STAN-CS-TR-98-1601.
2. C. Baier, B. Engelen, and M. E. Majster-Cederbaum. Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences, 60(1):187-231, 2000.
3. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. Technical Report 99/12, University of Twente, 1999.
4. C. Baier and M. Stoelinga. Norm functions for bisimulations with delays. In Proceedings of FOSSACS. Springer-Verlag, 2000.
5. M. Bernardo, L. Donatiello, and R. Gorrieri. Modeling and analyzing concurrent systems with MPA. In Proceedings of the Second Workshop on Process Algebras and Performance Modelling (PAPM), Erlangen, Germany, pages 175-189, 1994.
6. K. Fukuda. Polyhedral computation FAQ. http://www.ifor.math.ethz.ch/ ~fukuda/polyfaq/polyfaq.html, 2000.
7. R. v. Glabbeek, S. Smolka, and B. Steffen. Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1), 1996.
8. H. Hansson. Time and Probability in Formal Design of Distributed Systems, volume 1 of Real-Time Safety Critical Systems. Elsevier, 1994.
9. th IEEE Symposium on Real-Time Systems, Orlando, Fl., 1990.
10. H. Hermanns, U. Herzog, and J. Katoen. Process algebra for performance evaluation. To appear in Theoretical Computer Science.
11. J. Hillston. PEPA: Performance enhanced process algebra. Technical Report CSR-24-93, Department of Computer Science, Univ. of Edimburgh (UK), 1993.
12. J. Hillston. A Compositional Approach to Performance Modeling. PhD thesis, Department of Computer Science, Univ. of Edimburgh (UK), 1994.
13. P. Kanellakis and S. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
14. N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica 4, pages 373-395, 1984.
15. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer-Verlag, second edition, 1976.
16. th ACM Symposium on Principles of Programming Languages, Austin, Texas, pages 344-352, 1989.
17. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
18. C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Trans. Prog. Lang. Syst., 18(3):325-353, May 1996.
19. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6):973-989, 1987.
20. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In Proceedings of CONCUR 2000, pages 334-349. Springer-Verlag, 2000.
21. 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.
22. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In Proceedings of CONCUR 94, pages 481-496. Springer-Verlag, 1994.
23. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
24. K. Seidel. Probabilistic communicating processes. Technical Report PRG-102, Ph.D. Thesis, Programming Research Group, Oxford University, 1992.
25. S. Wu, S. Smolka, and E. Stark. Composition and behaviors of probabilistic I/O automata. Theoreti cal Comput. Sci., 176(1-2):1-38, 1999.