Skip to main content

Behavioral Equivalences

  • Reference work entry
Encyclopedia of Parallel Computing

Synonyms

Behavioral relations; Extensional equivalences

Definition

Behavioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment. Behavioral equivalences have been mainly developed in the context of process algebras, mathematically rigorous languages that have been used for describing and verifying properties of concurrent communicating systems. By relying on the so-called structural operational semantics (SOS), labeled transition systems are associated to each term of a process algebra. Behavioral equivalences are used to abstract from unwanted details and identify those labeled transition systems that react “similarly” to external experiments. Due to the large number of properties which may be relevant in the analysis of concurrent systems, many different theories of equivalences have been proposed in the literature. The main contenders...

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  1. Baeten JCM, Weijland WP (1984) Process algebra. Cambridge University Press, Cambridge

    Google Scholar 

  2. Brookes SD, Hoare CAR, Roscoe AW (1984) A theory of communicating sequential processes. J ACM 31(3):560–599

    MATH  MathSciNet  Google Scholar 

  3. De Nicola R (1987) Extensional equivalences for transition systems. Acta Informatica 24(2):211–237

    MATH  MathSciNet  Google Scholar 

  4. De Nicola R, Hennessy M (1984) Testing equivalences for processes. Theor Comput Sci 34:83–133

    MATH  Google Scholar 

  5. Hennessy M (1988) Algebraic theory of processes. The MIT Press, Cambridge

    MATH  Google Scholar 

  6. Hennessy M, Milner R (1985) Algebraic laws for nondeterminism and concurrency. J ACM 32(1):137–161

    MATH  MathSciNet  Google Scholar 

  7. Hoare CAR (1985) Communicating sequential processes. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  8. Milner R (1989) Communication and concurrency. Prentice-Hall, Upper Saddle River

    MATH  Google Scholar 

  9. Roscoe AW (1998) The theory and practice of concurrency. Prentice-Hall, Hertfordshire

    Google Scholar 

  10. Sangiorgi D (2009) On the origins of bisimulation and coinduction. ACM Trans Program Lang Syst 31(4):15.1–15.41

    Google Scholar 

  11. van Glabbeek RJ (2001) The linear time-branching time spectrum I: the semantics of concrete, sequential processes. In: Bergstra JA, Ponse A, Smolka SA (eds) Handbook of process algebra, Elsevier, Amsterdam, pp 3–99

    Google Scholar 

  12. van Glabbeek RJ (1993) The linear time-branching time spectrum  II. In: Best E (ed) CONCUR ’93, 4th international conference on concurrency theory, Hildesheim, Germany, Lecture notes in computer science, vol 715. Springer-Verlag, Heidelberg, pp 66–81

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

De Nicola, R. (2011). Behavioral Equivalences. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_517

Download citation

Publish with us

Policies and ethics