Probabilistic automata: System types, parallel composition and comparison

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

Volumn 2925, Issue , 2004, Pages 1-43

  Sokolova, Ana ^a   De Vink, Erik P ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Non determinism; Parallel composition; Preservation and reflection of bisimulation; Probabilistic automata (transition systems); Probabilistic bisimulation

Indexed keywords

AUTOMATA THEORY; PROBABILISTIC LOGICS;

NON DETERMINISM; PARALLEL COMPOSITION; PRESERVATION AND REFLECTION OF BISIMULATION; PROBABILISTIC BISIMULATIONS; TRANSITION SYSTEM;

ROBOTS;

EID: 21144435765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_1     Document Type: Review

References (89)

1. R. Alur and T.A. Henzinger, Reactive modules, Formal Methods in System Design 15 (1999), 7-48,
2. A preliminary version appeared in the Proceedings of the 11th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 1996, pp. 207-218.
3. L. de Alfaro, T.A. Henzinger, and R. Jhala, Compositional methods for probabilistic systems, CONCUR 2001 - Concurrency Theory: 12th International Conference, Aalborg, Denmark, August 20-25, 2001, LNCS, vol. 2154, Springer-Verlag, 2001, pp. 351-365.
4. L. de Alfaro, Formal verification of probabilistic systems, Ph.D. thesis, Stanford University, 1997.
5. _, Stochastic transition systems, International Conference on Concurrency Theory, CONCUR, vol. 1466, LNCS 1998, pp. 423-438.
6. S. Andova, Process algebra with probabilistic choice, Proc. 5th International AMAST Workshop, ARTS'99, Bamberg, Germany (J.-P. Katoen, ed.), LNCS 1601, Springer-Verlag, 1999, pp. 111-129.
7. _, Probabilistic process algebra, Ph.D. thesis, Eindhoven University of Technology, 2002.
8. A. Bianco and L. de Alfaro, Model checking of probabilistic and nondeterministic systems, Found. of Software Tech. and Theor. Comp. Sci., LNCS, vol. 1026, Springer-Verlag, 1995.
9. C. Baier, Polynomial time algorithms for testing probabilistic bisimulation and simulation, Proc. 8th International Conference on Computer Aided Verification (CAV'96), Lecture Notes in Computer Science, vol. 1102, 1996, pp. 38-49.
10. C. Baier, On algorithmic verification methods for probabilistic systems, Habilitationsschrift, FMI, Universitaet Mannheim, 1998.
11. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka, Axiomatizing probabilistic processes: ACP with generative probabilities, Information and Computation 121 (1995), no. 2, 234-255.
12. R. Blute, J. Desharnais, A. Edalat, and P. Panangaden, Bisimulation for labelled Markov processes, LICS'97, 1997, pp. 149-158.
13. C. Baier, P.R. D'Argenio, H. Hermanns, and J.-P. Katoen, How to cook a probabilistic process calculus, unpublished, 1999.
14. C. Baier, B. Engelen, and M. Majster-Cederbaum, Deciding bisimilarity and similarity for probabilistic processes, Journal of Computer and System Sciences 60 (1999), 187-231.
15. M. Bernardo, Theory and application of extended Markovian process algebra, Ph.D. thesis, University of Bologna, 1999.
16. M. Bernardo and R. Gorrieri, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, Theoretical Computer Science 202 (1998), no. 1, 1-54.
17. E. Brinksma and H. Hermanns, Process algebra and Markov chains, Lectures on Formal Methods and Performance Analysis, First EEF/Euro Summer School on Trends in Computer Science, Berg en Dal, The Netherlands, July 3-7, 2000 (E. Brinksma, H. Hermanns, and J.-P. Katoen, eds.), LNCS, vol. 2090, SpringerVerlag, 2001, pp. 183-232.
18. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen, Model checking continuous-time Markov chains by transient analysis, CAV 2000, vol. 1855, LNCS, Springer-Verlag, 2000, pp. 358-372.
19. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe, A theory of communicating sequential processes, Journal of the ACM 31 (1984), 560-599.
20. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science 37 (1985), 77-121.
21. C. Baier and M.Z. Kwiatkowska, Domain equations for probabilistic processes, 4th Workshop on Expressiveness in Concurrency (EXPRESS'97), Santa Margherita, vol. 7, Electronic Notes in Theoretical Computer Science, 1997.
22. _, Domain equations for probabilistic processes, Mathematical Structures in Computer Science 10 (2000), 665-717.
23. A. Benveniste, B. C. Levy, E. Fabre, and P. Le Guernic, A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/non-stochastic systems, Theoretical Computer Science 152 (1995), 171-217.
24. B. Bloom and A. R. Meyer, A remark on bisimulation between probabilistic processes, Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 363, Springer-Verlag, 1989, pp. 26-40.
25. C. Baier and M.I.A. Stoelinga, Norm fuctions for probabilistic bisimulations with delays, Proceedings of 3rd International Conference on Foundations of Science and Computation Structures (FOSSACS), Berlin, Germany, March 2000 (J. Tiuryn, ed.), LNCS, vol. 1784, "Springer-Verlag", 2000, pp. 1-16.
26. E. Bandini and R. Segala, Axiomatizations for probabilistic bisimulation, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) 2001, Crete, LNCS 2076, 2001, pp. 370-381.
27. F. Bartels, A. Sokolova, and E.P. de Vink, A hierarchy of probabilistic system types, Electronic Notes in Theoretical Computer Science (H. Peter Gumm, ed.), vol. 82, Elsevier, 2003.
28. P. Buchholz, Markovian process algebra: Composition and equivalence, in Proc. of PAPM '94, Erlangen (Germany), 1994, pp. 11-30.
29. L. Christoff and I. Christoff, Efficient algorithms for verification of equivalences for probabilistic processes, Proc. Workshop on Computer Aided Verification 1991 (K. Larsen and A. Skou, eds.), LNCS, vol. 575, 1991.
30. I. Christoff, Testing equivalences and fully abstract models for probabilistic processes, Proceedings of CONCUR'90 (J.C.M. Baeten and J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990, pp. 126-140.
31. R. Cleaveland, S.A. Smolka, and A. Zwarico, Testing preorders for probabilistic processes, Automata, Languages and Programming (ICALP '92), Vienna, LNCS, vol. 623, Springer-Verlag, 1992, pp. 708-719.
32. C. Courcoubetis and M. Yannakakis, The complexity of probabilistic verification, Journal of the ACM (JACM) 42 (1995), 857-907.
33. P.R. D'Argenio, Algebras and automata for timed and stochastic system, Ph.D. thesis, University of Twente, 1999.
34. J. Desharnais, A. Edalat, and P. Panangaden, A logical characterization of bisimulation for labeled Markov processes, Proc. LICS'98 (Indianapolis), 1998, pp. 478-487.
35. C. Derman, Finite state Markovian decision proceses, Academic Press, 1970.
36. P. D'Argenio, H. Hermanns, and J-P. Katoen, On generative parallel composition, Proc. PROBMIV'98, ENTCS 22, 1998, pp. 105-122.
37. P.R. D'Argenio, B. Jeannet, H.E. Jensen, and K.G. Larsen, Reachability analysis of probabilistic systems by successive refinements, PAPM-PROBMIV 2001, Aachen, Germany (L. de Alfaro and S. Gilmore, eds.), LNCS, vol. 2165, Springer-Verlag, 2001, pp. 29-56.
38. _, Reduction and refinement strategies for probabilistic analysis, PAPMPROBMIV 2002, Copenhagen, Denmark (H. Hermanns and R. Segala, eds.), LNCS, Springer-Verlag, 2002.
39. A. Giacalone, C. Jou, and S. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. of the Working Conf. on Programming Concepts and Methods, 1990. (M. Broy and C.B. Jones, eds.), North Holland, 1990, pp. 443-458.
40. R.J. van Glabbeek, S.A. Smolka, and B. Steffen, Reactive, generative, and stratified models of probabilistic processes, Information and Computation 121 (1995), 59-80.
41. R. J. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts, Reactive, generative, and stratified models of probabilistic processes, Logic in Computer Science, 1990, pp. 130-141.
42. H. A. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, Uppsala University, Department of Computer Systems, 1991, Also appeared in Real-Time Safety Critical Systems, vol. 1, Elsevier, 1994.
43. J.I. den Hartog, Probabilistic extensions of semantical models, Ph.D. thesis, Vrije Universiteit Amsterdam, 2002.
44. B. R. Haverkort, Markovian models for performance and dependability evaluation, Lectures on Formal Methods and Performance Analysis, First EEF/Euro Summer School on Trends in Computer Science, Berg en Dal, The Netherlands, July 3-7, 2000 (E. Brinksma, H. Hermanns, and J.-P. Katoen, eds.), LNCS, vol. 2090, Springer-Verlag, 2001, pp. 38-84.
45. H. Hermanns, Interactive Markov chains, Ph.D. thesis, Universiät Erlangen-Nürnberg, 1998, Revised version appeared as Interactive Markov Chains And the Quest for Quantified Quality, LNCS 2428, 2002.
46. J. Hillston, A compositional approach to performance modelling, Ph.D. thesis, University of Edinburgh, 1994, Also appeared in the CPHC/BCS Distinguished Dissertation Series, Cambridge University Press, 1996.
47. H. Hansson and B. Jonsson, A logic for reasoning about time and reliability, Formal Aspects of Computing 6 (1994), 512-535.
48. C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, 1985.
49. R. A. Howard, Dynamic probabilistic systems, John Wiley & Sons, Inc., New York, 1971.
50. J.I. den Hartog and E.P. de Vink, Mixing up nondeterminism and probability: A preliminary report, Proc. PROBMIV'98 (C. Baier, M. Huth, M. Kwiatkowska, and M. Ryan, eds.), ENTCS 22, 1998.
51. _, Verifying probabilistic programs using a Hoare-like logic, International Journal of Foundations of Computer Science 13 (2002), 315-340.
52. B. Jonsson and K.G. Larsen, Specification and refinement of probabilistic processes, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS '91., IEEE, 1991.
53. B. Jonsson, K.G. Larsen, and W. Yi, Probabilistic extensions of process algebras, Handbook of Process Algebras, Elsevier, North Holland, 2001.
54. B.P.F. Jacobs and J.J.M.M. Rutten, A tutorial on (co)algebras and (co)induction, Bulletin of the EATCS 62 (1996), 222-259.
55. C.-C. Jou and S.A. Smolka, Equivalences, congruences and complete axiomatizations for probabilistic processes, Proceedings of CONCUR'90 (J.C.M. Baeten and J.W. Klop, eds.), Springer-Verlag, 1990, pp. 367-383.
56. B. Jonnson and W. Yi, Testing preorders for probabilistic processes can be characterized by simulations, Theoretical Computer Science 282 (2002), 33-51.
57. M.Z. Kwiatkowska and G.J. Norman, A testing equivalence for reactive probabilistic processes, EXPRESS '98 Fifth International Workshop on Expressiveness in Concurrency, ENTCS 16(2), 1998.
58. J. G. Kemeny and J. L. Snell, Finite Markov Chains, Springer-Verlag, New York, 1976.
59. N. López and M. Núñez, An overview of probabilistic process algebras and their equivalences, 2003, this volume.
60. G. Lowe, Probabilistic and prioritized models of timed CSP, Theoretical Computer Science 138 (1995), 315-352.
61. L. R. Lewis and C. H. Papadimitriou, Elements of the theory of computation, Prentice-Hall, Englewood Cliffs, NJ, 1981.
62. K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation 94 (1991), 1-28.
63. K.G. Larsen and A. Skou, Compositional verification of probabilistic processes, CONCUR '92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA (R. Cleaveland, ed.), LNCS, vol. 630, Springer-Verlag, 1992, pp. 456-471.
64. N. A. Lynch and M. Tuttle, Hierarchical completeness proofs for distributed algorithms, Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, 1987.
65. S. MacLane, Categories for the working mathematician, Springer-Verlag, 1971.
66. R. Milner, Calculi for synchrony and asynchrony, Theoretical Computer Science 25 (1983), 267-310.
67. _, Communication and Concurrency, Prentice-Hall, 1989.
68. C. Morgan, A. McIver, K. Seidel, and J.W. Sanders, Refinement oriented probability for CSP, Formal aspects of computing 8 (1996), 617-647.
69. L.S. Moss, Coalgebraic logic, Annals of Pure and Applied Logic 96 (1999), 277-317.
70. G. Norman, Metric semantics for reactive probabilistic processes, Ph.D. thesis, School of Computer Science, University of Birmingham, 1997.
71. B. Plateau and K. Atif, Stochastic automata network for modeling parallel systems, IEEE Trans. on Software Engineering 17 (1991), 1093-1108.
72. A. Pnueli and L. Zuck, Verification of multiprocess probabilistic protocols, Distributed Computing 1 (1986), no. 1, 53-72.
73. _, Probabilistic verification, Information and Computation 103 (1993), 1-29.
74. M.O. Rabin, Probabilistic automata, Information and Control 6 (1963), 230-245.
75. J.J.M.M. Rutten, Universal coalgebra: A theory of systems, Theoretical Computer Science 249 (2000), 3-80.
76. E.W. Stark, R. Cleaveland, and S.A. Smolka, A process-algebraic language for probabilistic I/O automata, Proc. CONCUR'03 (R. Amadio and D. Lugiez, eds.), LNCS, vol. 2761, Springer, 2003, pp. 193-207.
77. R. Segala, Modeling and verification of randomized distributed real-time systems, Ph.D. thesis, MIT, 1995.
78. K. Seidel, Probabilistic communicating processes, Theoretical Computer Science 152 (1995), 219-249.
79. R. Segala and N.A. Lynch, Probabilistic simulations for probabilistic processes, Proc. Concur'94, LNCS 836, 1994, pp. 481-496.
80. S. A. Smolka and B.U. Steffen, Priority as extremal probability, Proceedings of CONCUR'90 (J.C.M. Baeten and J.W. Klop, eds.), LNCS, vol. 458, Springer-Verlag, 1990, pp. 456-466.
81. M.I.A. Stoelinga, Alea jacta est: verification of probabilistic, real-time and parametric systems, Ph.D. thesis, University of Nijmegen, the Netherlands, 2002.
82. _, An introduction to probabilistic automata, EATCS bulletin, vol. 78, 2002.
83. M.I.A. Stoelinga and F.W. Vaandrager, Root contention in IEEE 1394, Proc. 5th International AMAST Workshop, ARTS'99, Bamberg, Germany (J.-P. Katoen, ed.), LNCS, vol. 1601, Springer-Verlag, 1999, pp. 53-75.
84. _, A testing scenario for probabilistic automata, Proceedings of the 30th International colloquium on automata, languages and programming (ICALP'03) Eindhoven, the Netherlands, June 2003, LNCS, vol. 2719, Springer-verlag, 2003, pp. 464-477.
85. M.Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, Proc. FOCS'95 (Portland, Oregon), IEEE Computer Society Press, 1985, pp. 327-338.
86. E.P. de Vink, On a functor for probabilistic bisimulation and the preservation of weak pullbacks, Tech. Report IR-444, Vrije Universiteit Amsterdam, 1998.
87. E.P. de Vink and J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, Theoretical Computer Science 221 (1999), 271-293.
88. S.-H. Wu, S. A. Smolka, and E. W. Stark, Composition and behaviors of probabilistic I/O automata, Theoretical Computer Science 176 (1997), 1-38.
89. W. Yi and K.G. Larsen, Testing preorders for probabilistic and non-deterministic processes, Protocol Specification, Testing and Verification (Florida, USA), vol. 12, 1992, pp. 47-61.