Skip to main content
SpringerLink
Log in

An Overview of Probabilistic Process Algebras and Their Equivalences

  • Chapter
Validation of Stochastic Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2925))

Abstract

In order to describe probabilistic processes by means of a formal model, some considerations have to be taken into account. In this paper we present some of the ideas appeared in the literature that could help to define appropriate formal frameworks for the specification of probabilistic processes. First, we will explain the different interpretations of the probabilistic information included in this kind of models. After that, the different choice operators used in the most common probabilistic languages are enumerated. Once we have an appropriate language, we have to give its semantics. Thus, we will review some of the theories based on bisimulation and testing semantics. We will conclude by studying the extensions of the chosen languages with other operators such as parallel composition and hiding.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andova, S., Baeten, J.C.M.: Abstraction in probabilistic process algebra. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 204–219. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Bravetti, M., Aldini, A.: Expressing processes with different action durations through probabilities. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 168–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Bravetti, M., Aldini, A.: Discrete time generative-reactive probabilistic processes with different advancing speeds. Theoretical Computer Science 290(1), 355–406 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bravetti, M., Bernardo, M.: Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time. In: MTCS 2000. Electronics Notes in Theoretical Computer Science, vol. 39(3). Elsevier, Amsterdam (2000)

    Google Scholar 

  5. Baeten, J.C.M., Bergstra, J.A., Smolka, S.A.: Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation 121(2), 234–255 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 119–130. Springer, Heidelberg (1997)

    Google Scholar 

  7. Bloom, B., Meyer, A.R.: A remark on bisimulation between probabilistic processes. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 26–40. Springer, Heidelberg (1989)

    Google Scholar 

  8. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)

    MATH  Google Scholar 

  9. Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313–327. Springer, Heidelberg (1995)

    Google Scholar 

  10. Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 370–381. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  12. Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming 55(1–2), 57–103 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L.: A process algebra for probabilistic and nondeterministic processes. Information Processing Letters 80, 15–23 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cuartero, F., de Frutos, D., Valero, V.: A sound and complete proof system for probabilistic processes. In: AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol. 1231, pp. 340–352. Springer, Heidelberg (1997)

    Google Scholar 

  15. Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation 154(2), 93–148 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Christoff, I.: Testing equivalences and fully abstract models for probabilistic processes. In: CONCUR 1990. LNCS, vol. 458, pp. 126–140. Springer, Heidelberg (1990)

    Google Scholar 

  17. Cleaveland, R., L’́uttgen, G., Natarajan, V.: Priority in process algebra. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of process algebra, ch. 12. North-Holland, Amsterdam (2001)

    Google Scholar 

  18. Cleaveland, R., Smolka, S.A., Zwarico, A.E.: Testing preorders for probabilistic processes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 708–719. Springer, Heidelberg (1992)

    Google Scholar 

  19. Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: 29th IEEE Symposium on Foundations of Computer Science, pp. 338–345. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  20. de Frutos-Escrig, D., Llana-Díaz, L.F., Núñez, M.: Friendly testing as a conformance relation. In: Formal Description Techniques for Distributed Systems and Communication Protocols (X), and Protocol Specification, Testing, and Verification (XVII), pp. 283–298. Chapman & Hall, Boca Raton (1997)

    Google Scholar 

  21. de Frutos-Escrig, D., López, N., Núñez, M.: Global timed bisimulation: An introduction. In: Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pp. 401–416. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  22. Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for PCTL*. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 355–370. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. D’Argenio, P.R., Hermanns, H., Katoen, J.-P.: On generative parallel composition. In: PROBMIV 1998. Electronics Notes in Theoretical Computer Science, vol. 22. Elsevier, Amsterdam (1999)

    Google Scholar 

  24. de Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  25. Feldman, Y.A., Harel, D.: A probabilistic dinamic logic. In: 14th ACM Symposium on Theory of Computing, pp. 181–195. ACM Press, New York (1982)

    Google Scholar 

  26. Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceedings of Working Conference on Programming Concepts and Methods. IFIP TC 2. North Holland, Amsterdam (1990)

    Google Scholar 

  27. Gregorio, C., Núñez, M.: Denotational semantics for probabilistic refusal testing. In: PROBMIV 1998. Electronic Notes in Theoretical Computer Science, vol. 22. Elsevier, Amsterdam (1999)

    Google Scholar 

  28. van Glabbeek, R., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation 121(1), 59–80 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  29. van Glabbeek, R., Smolka, S.A., Steffen, B., Tofts, C.M.N.: Reactive, generative, and stratified models of probabilistic processes. In: 5th IEEE Symposium on Logic In Computer Science, pp. 130–141. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  30. van Glabbeek, R., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555–600 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  31. Hennessy, M.: An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science 49, 121–143 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  32. Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  33. Hansson, H., Jonsson, B.: A framework for reasoning about time and realibility. In: 10th IEEE Real-Time Systems Symposium. IEEE Computer Society Press, Los Alamitos (1989)

    Google Scholar 

  34. Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: 11th IEEE Real-Time Systems Symposium, pp. 278–287. IEEE Computer Society Press, Los Alamitos (1990)

    Chapter  Google Scholar 

  35. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  36. Hart, S., Sharir, M.: Probabilistic temporal logics for finite and bounded models. In: 16th ACM Symposium on Theory of Computing, pp. 1–13. ACM Press, New York (1984)

    Google Scholar 

  37. Jones, C., Plotkin, G.D.: A probabilistic powerdomain of evaluations. In: 4th IEEE Symposium on Logic In Computer Science, pp. 186–195. IEEE Computer Society Press, Los Alamitos (1989)

    Google Scholar 

  38. Kwiatkowska, M., Norman, G.J.: A testing equivalence for reactive probabilistic processes. In: EXPRESS 1998. Electronic Notes in Theoretical Computer Science, vol. 16. Elsevier, Amsterdam (1998)

    Google Scholar 

  39. Kozen, D.: A probabilistic PDL. In: 15th ACM Symposium on Theory of Computing, pp. 291–297. ACM Press, New York (1983)

    Google Scholar 

  40. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  41. LOTOS. A formal description technique based on the temporal ordering of observational behaviour. IS 8807, TC97/SC21 (1988)

    Google Scholar 

  42. Lowe, G.: Probabilistic and prioritized models of timed CSP. Theoretical Computer Science 138, 315–352 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  43. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. In: 16th ACM Simposium on Principles of Programming Languages, pp. 344–352. ACM Press, New York (1989)

    Chapter  Google Scholar 

  44. Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  45. Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: 6th ACM Symp. on Principles of Distributed Computing, pp. 137–151. ACM Press, New York (1987)

    Chapter  Google Scholar 

  46. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science 253, 267–310 (1983)

    Article  MathSciNet  Google Scholar 

  47. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  48. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: 19th ICALP. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Google Scholar 

  49. Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: 22nd ICALP. LNCS, vol. 944, pp. 648–659. Springer, Heidelberg (1995)

    Google Scholar 

  50. Narayan Kumar, K., Cleaveland, R., Smolka, S.A.: Infinite probabilistic and nonprobabilistic testing. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 209–220. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  51. Núñez, M., de Frutos, D.: Testing semantics for probabilistic LOTOS. In: Formal Description Techniques VIII, pp. 365–380. Chapman & Hall, Boca Raton (1995)

    Google Scholar 

  52. Núñez, M., de Frutos, D., Llana, L.: Acceptance trees for probabilistic processes. In: CONCUR 1995. LNCS, vol. 962, pp. 249–263. Springer, Heidelberg (1995)

    Google Scholar 

  53. Núñez, M., Rupérez, D.: Fair testing through probabilistic testing. In: Formal Description Techniques for Distributed Systems and Communication Protocols (XII), and Protocol Specification, Testing, and Verification (XIX), pp. 135–150. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  54. Núñez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming 56(1–2), 117–177 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  55. Phillips, I.: Refusal testing. Theoretical Computer Science 50(3), 241–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  56. Philippou, A., Lee, I., Sokolsky, O.: Weak bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 334–349. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  57. Rabin, M.O.: Probabilistic automata. Information and Control 6, 230–245 (1963)

    Article  Google Scholar 

  58. Stark, E.W., Cleaveland, R., Smolka, S.A.: A process-algebraic language for probabilistic I/O automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 193–207. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  59. Sokolova, A., de Vink, E.P.: Probabilistic automata: System types, parallel composition and comparison. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 1–43. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  60. Seidel, K.: Probabilistic communicating processes. Theoretical Computer Science 152, 219–249 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  61. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994)

    Google Scholar 

  62. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250–273 (1995)

    MATH  MathSciNet  Google Scholar 

  63. Stark, E.W., Smolka, S.A.: A complete axiom system for finite-state probabilistic processes. In: Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, Cambridge (2000)

    Google Scholar 

  64. Stoelinga, M., Vaandrager, F.W.: Root contention in IEEE 1394. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 53–74. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  65. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th IEEE Symposium on Foundations of Computer Science, pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)

    Google Scholar 

  66. Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I/O automata. In: CONCUR 1994. LNCS, vol. 836, pp. 513–528. Springer, Heidelberg (1994)

    Google Scholar 

  67. Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science 176(1-2), 1–37 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  68. Yuen, S., Cleaveland, R., Dayar, Z., Smolka, S.A.: Fully abstract characterizations of testing preorders for probabilistic processes. In: CONCUR 1994. LNCS, vol. 836, pp. 497–512. Springer, Heidelberg (1994)

    Google Scholar 

  69. Yi, W., Larsen, K.G.: Testing probabilistic and nondeterministic processes. In: Protocol Specification, Testing and Verification XII, pp. 47–61. North Holland, Amsterdam (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. Sistemas Informáticos y Programación, Universidad Complutense de Madrid,  

    Natalia López & Manuel Núñez

Authors
  1. Natalia López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manuel Núñez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science, Technical University Dresden, Germany

    Christel Baier

  2. Centre for Telematics and Information Technology, Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500, AE, Netherlands

    Boudewijn R. Haverkort

  3. VASY, INRIA, Grenoble Rhône-Alpes, France

    Holger Hermanns

  4. Software Modeling and Verification, RWTH Aachen University, Germany

    Joost-Pieter Katoen

  5. Institut für Technische Informatik, Universität der Bundeswehr München,  

    Markus Siegle

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

López, N., Núñez, M. (2004). An Overview of Probabilistic Process Algebras and Their Equivalences. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, JP., Siegle, M. (eds) Validation of Stochastic Systems. Lecture Notes in Computer Science, vol 2925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24611-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24611-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22265-1

  • Online ISBN: 978-3-540-24611-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation