An overview of probabilistic process algebras and their equivalences

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

Volumn 2925, Issue , 2004, Pages 89-123

  López, Natalia ^a   Núñez, Manuel ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATIONS; FORMAL FRAMEWORK; PARALLEL COMPOSITION; PROBABILISTIC INFORMATION; PROBABILISTIC LANGUAGE; PROBABILISTIC PROCESS; PROBABILISTIC PROCESS ALGEBRA; TESTING SEMANTICS;

SEMANTICS;

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

References (69)

1. S. Andova and J.C.M. Baeten. Abstraction in probabilistic process algebra. In TACAS 2001, LNCS 2031, pages 204-219. Springer, 2001.
2. M. Bravetti and A. Aldini. Expressing processes with different action durations through probabilities. In PAPM-PROBMIV 2001, LNCS 2165, pages 168-183. Springer, 2001.
3. M. Bravetti and A. Aldini. Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science, 290(1):355-406, 2003.
4. M. Bravetti and M. Bernardo. Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In MTCS 2000, Electronics Notes in Theoretical Computer Science 39(3). Elsevier, 2000.
5. J.C.M. Baeten, J.A. Bergstra, and S.A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2):234-255, 1995.
6. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Computer Aided Verification'97, LNCS 1254, pages 119-130. Springer, 1997.
7. B. Bloom and A.R. Meyer. A remark on bisimulation between probabilistic processes. In Logic at Botik'89, LNCS 363, pages 26-40. Springer, 1989.
8. J.A. Bergstra, A. Ponse, and S.A. Smolka, editors. Handbook of Process Algebra. North Holland, 2001.
9. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In CONCUR'95, LNCS 962, pages 313-327. Springer, 1995.
10. E. Bandini and R. Segala. Axiomatizations for probabilistic bisimulation. In ICALP 2001, LNCS 2076, pages 370-381. Springer, 2001.
11. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Computer Science 18. Cambridge University Press, 1990.
12. D. Cazorla, F. Cuartero, V. Valero, F.L. Pelayo, and J.J. Pardo. Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming, 55(1-2):57-103, 2003.
13. D. Cazorla, F. Cuartero, V. Valero, and F.L. Pelayo. A process algebra for probabilistic and nondeterministic processes. Information Processing Letters, 80:15-23, 2001.
14. F. Cuartero, D. de Frutos, and V. Valero. A sound and complete proof system for probabilistic processes. In 4th International AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software, LNCS 1231, pages 340-352. Springer, 1997.
15. R. Cleaveland, Z. Dayar, S.A. Smolka, and S. Yuen. Testing preorders for probabilistic processes. Information and Computation, 154(2):93-148, 1999.
16. I. Christoff. Testing equivalences and fully abstract models for probabilistic processes. In CONCUR'90, LNCS 458, pages 126-140. Springer, 1990.
17. R. Cleaveland, G. Lüttgen, and V. Natarajan. Priority in process algebra. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of process algebra, chapter 12. North Holland, 2001.
18. R. Cleaveland, S.A. Smolka, and A.E. Zwarico. Testing preorders for probabilistic processes. In 19th ICALP, LNCS 623, pages 708-719. Springer, 1992.
19. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite-state probabilistic programs. In 29th IEEE Symposium on Foundations of Computer Science, pages 338-345. IEEE Computer Society Press, 1988.
20. D. de Frutos-Escrig, L.F. Llana-Díaz, and M. Núñez. Friendly testing as a conformance relation. In Formal Description Techniques for Distributed Systems and Communication Protocols (X), and Protocol Specification, Testing, and Verification (XVII), pages 283-298. Chapman & Hall, 1997.
21. D. de Frutos-Escrig, N. López, and M. Núñez. Global timed bisimulation: An introduction. In Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pages 401-416. Kluwer Academic Publishers, 1999.
22. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Weak bisimulation is sound and complete for PCTL*. In CONCUR 2002, LNCS 2421, pages 355-370. Springer, 2002.
23. P.R. D'Argenio, H. Hermanns, and J.-P. Katoen. On generative parallel composition. In PROBMIV'98, Electronics Notes in Theoretical Computer Science 22. Elsevier, 1999.
24. R. de Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
25. Y.A. Feldman and D. Harel. A probabilistic dinamic logic. In 14th ACM Symposium on Theory of Computing, pages 181-195. ACM Press, 1982.
26. A. Giacalone, C.-C. Jou, and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2. North Holland, 1990.
27. C. Gregorio and M. Núñez. Denotational semantics for probabilistic refusal testing. In PROBMIV'98, Electronic Notes in Theoretical Computer Science 22. Elsevier, 1999.
28. R. van Glabbeek, S.A. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 1995.
29. R. van Glabbeek, S.A. Smolka, B. Steffen, and C.M.N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In 5th IEEE Symposium on Logic In Computer Science, pages 130-141. IEEE Computer Society Press, 1990.
30. R. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, 1996.
31. M. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science, 49:121-143, 1987.
32. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
33. H. Hansson and B. Jonsson. A framework for reasoning about time and realibility. In 10th IEEE Real-Time Systems Symposium. IEEE Computer Society Press, 1989.
34. H. Hansson and B. Jonsson. A calculus for communicating systems with time and probabilities. In 11th IEEE Real-Time Systems Symposium, pages 278-287. IEEE Computer Society Press, 1990.
35. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
36. S. Hart and M. Sharir. Probabilistic temporal logics for finite and bounded models. In 16th ACM Symposium on Theory of Computing, pages 1-13. ACM Press, 1984.
37. C. Jones and G.D. Plotkin. A probabilistic powerdomain of evaluations. In 4th IEEE Symposium on Logic In Computer Science, pages 186-195. IEEE Computer Society Press, 1989.
38. M. Kwiatkowska and G.J. Norman. A testing equivalence for reactive probabilistic processes. In EXPRESS'98, Electronic Notes in Theoretical Computer Science 16. Elsevier, 1998.
39. D. Kozen. A probabilistic PDL. In 15th ACM Symposium on Theory of Computing, pages 291-297. ACM Press, 1983.
40. J.G. Kemeny and J.L. Snell. Finite Markov Chains. Springer, 1976.
41. LOTOS. A formal description technique based on the temporal ordering of observational behaviour. IS 8807, TC97/SC21, 1988.
42. G. Lowe. Probabilistic and prioritized models of timed CSP. Theoretical Computer Science, 138:315-352, 1995.
43. K. Larsen and A. Skou. Bisimulation through probabilistic testing. In 16th ACM Simposium on Principles of Programming Languages, pages 344-352. ACM Press, 1989.
44. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
45. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In 6th ACM Symp. on Principles of Distributed Computing, pages 137-151. ACM Press, 1987.
46. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 253:267-310, 1983.
47. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
48. R. Milner and D. Sangiorgi. Barbed bisimulation. In 19th ICALP, LNCS 623, pages 685-695. Springer, 1992.
49. V. Natarajan and R. Cleaveland. Divergence and fair testing. In 22nd ICALP, LNCS 944, pages 648-659. Springer, 1995.
50. K. Narayan Kumar, R. Cleaveland, and S.A. Smolka. Infinite probabilistic and nonprobabilistic testing. In 18th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1530, pages 209-220. Springer, 1998.
51. M. Núñez and D. de Frutos. Testing semantics for probabilistic LOTOS. In Formal Description Techniques VIII, pages 365-380. Chapman & Hall, 1995.
52. M. Núñez, D. de Frutos, and L. Llana. Acceptance trees for probabilistic processes. In CONCUR'95, LNCS 962, pages 249-263. Springer, 1995.
53. M. Núñez and D. Rupérez. Fair testing through probabilistic testing. In Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pages 135-150. Kluwer Academic Publishers, 1999.
54. M. Núñez. Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming, 56(1-2):117-177, 2003.
55. I. Phillips. Refusal testing. Theoretical Computer Science, 50(3):241-284, 1987.
56. A. Philippou, I. Lee, and O. Sokolsky. Weak bisimulation for probabilistic systems. In CONCUR 2000, LNCS 1877, pages 334-349. Springer, 2000.
57. M.O. Rabin. Probabilistic automata. Information and Control, 6:230-245, 1963.
58. E.W. Stark, R. Cleaveland, and S.A. Smolka. A process-algebraic language for probabilistic I/O automata. In CONCUR'03, LNCS 2761. Springer, 2003.
59. A. Sokolova and E.P. de Vink. Probabilistic automata: System types, parallel composition and comparation. In VOSS GI-Dagstuhl seminar, LNCS. Springer, 2003. This volume.
60. K. Seidel. Probabilistic communicating processes. Theoretical Computer Science, 152:219-249, 1995.
61. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR'94, LNCS 836, pages 481-496. Springer, 1994.
62. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
63. E.W. Stark and S.A. Smolka. A complete axiom system for finite-state probabilistic processes. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.
64. M. Stoelinga and F.W. Vaandrager. Root contention in IEEE 1394. In 5th AMAST Workshop on Real-Time and Probabilistic Systems, LNCS 1601, pages 53-74. Springer, 1999.
65. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In 26th IEEE Symposium on Foundations of Computer Science, pages 327-338. IEEE Computer Society Press, 1985.
66. S.-H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. In CONCUR'94, LNCS 836, pages 513-528. Springer, 1994.
67. S.-H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science, 176(1-2):1-37, 1997.
68. S. Yuen, R. Cleaveland, Z. Dayar, and S.A. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes. In CONCUR'94, LNCS 836, pages 497-512. Springer, 1994.
69. W. Yi and K.G. Larsen. Testing probabilistic and nondeterministic processes. In Protocol Specification, Testing and Verification XII, pages 47-61. North Holland, 1992.