Skip to main content
SpringerLink
Log in

Deriving Bisimulation Congruences for Reactive Systems

  • Conference paper
  • First Online:
Book cover CONCUR 2000 — Concurrency Theory (CONCUR 2000)

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

Included in the following conference series:

Abstract

The dynamics of reactive systems, e.g. CCS, has often been defined using a labelled transition system (LTS). More recently it has become natural in defining dynamics to use reaction rules - i.e. unlabelled transition rules - together with a structural congruence. But LTSs lead more naturally to behavioural equivalences. So one would like to derive from reaction rules a suitable LTS.

This paper shows how to derive an LTS for a wide range of reactive systems. A label for an agent a is defined to be any context F which intuitively is just large enough so that the agent Fa (“a in context F”) is able to perform a reaction. The key contribution of this paper is a precise definition of “just large enough”, in terms of the categorical notion of relative pushout (RPO), which ensures that bisimilarity is a congruence when sufficient RPOs exist. Two examples - a simplified form of action calculi and term-rewriting - are given, for which it is shown that sufficient RPOs indeed exist. The thrust of this paper is, therefore, towards a general method for achieving useful behavioural congruence relations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ariola, Z. M. and Klop, J. W., Equational term graph rewriting. Fundamentae Informaticae, 26(3,4), pp. 207–240, 1996.

    MATH  MathSciNet  Google Scholar 

  2. Abadi, M. and Gordon, A. D., A calculus for cryptographic protocols: the spi calculus. Proc. Fourth ACM Conf. on Computer and Communications Security, Zürich, ACM Press, pp. 36–47, 1997.

    Chapter  Google Scholar 

  3. Baeten, J. C. and Weiland, W. P., Process algebra. CUP, 1990.

    Google Scholar 

  4. Berry, G. and Boudol, G., The chemical abstract machine. Theor. Comp. Sci. 96, pp. 217–248, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. Cardelli, L. and Gordon, A. D., Mobile ambients. Foundations of System Specification and Computational Structures, LNCS 1378, pp. 140–155., 1998.

    Google Scholar 

  6. Corradini, A. and Montanari, U., An algebra of graphs and graph rewriting. Proc. Fourth Biennial Conf. on Category Theory and Computer Science, LNCS 530, pp. 236–260, 1991.

    Chapter  Google Scholar 

  7. Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., and Rémy, D., A calculus of mobile agents. Proc. CONCUR’96, LNCS 1119, pp. 406–421

    Google Scholar 

  8. Gardner, P., Closed action calculi. Theor. Comp. Sci. 228(1,2), pp. 77–103, 1999.

    Article  MATH  Google Scholar 

  9. van Glabbeek, R. J., The linear time-branching time spectrum. Proc. CONCUR’90, LNCS 458, pp. 278–297, 1990.

    Google Scholar 

  10. Groote, J. F. and Vaandrager, F. W., Structural operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202–260, 1992

    Article  MATH  MathSciNet  Google Scholar 

  11. Hasegawa, M. Models of sharing graphs (a categorical semantics of let and letrec). PhD thesis, LFCS, University of Edinburgh, 1997.

    Google Scholar 

  12. Hoare, C.A. R., Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  13. Jeffrey, A. and Rathke, J., Towards a theory of bisimulation for local names. Proc. LICS’99, IEEE Press, pp. 56–66, 1999.

    Google Scholar 

  14. Joyal, A., Nielsen, M. and Winskel, G., Bisimulation from open maps. Information and Computation 127(2), pp. 164–185, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  15. Milner, R., Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  16. Milner, R., Functions as processes. Mathematical Structures in Computer Science 2(2), pp. 119–141, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. Milner, R., Calculi for interaction. Acta Informatica 33(8), pp. 707–737, 1996.

    Article  MathSciNet  Google Scholar 

  18. Milner, R., Parrow, J. and Walker, D., A calculus of mobile processes, Parts 1 and 2. Information and Computation 100(1), pp. 1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  19. Milner, R. and Sangiorgi, D., Barbed bisimulation. Proc. ICALP’92, LNCS 623, pp. 685–695, 1992.

    Google Scholar 

  20. Pitts, A. M. and Stark, I. D. B., Observable properties of higher order functions that dynamically create local names, or: What’s new? Proc. MFCS, LNCS 711, pp 122–141, 1993.

    Google Scholar 

  21. Park, D., Concurrency and automata on infinite sequences. Lect Notes Comput Sci 104, 1980.

    Google Scholar 

  22. Sewell, P., From rewrite rules to bisimulation congruences. Proc. CONCUR’98, LNCS 1466, pp. 269–284, 1998. [Revised version to appear in a special issue of Theor. Comp. Sci.]

    Google Scholar 

  23. Sewell, P., Global/local subtyping and capability inference for a distributed picalculus. Proc. ICALP’98, 4 1443, pp. 695–706

    Google Scholar 

  24. Turi, D. and Plotkin, G. Towards a mathematical operational semantics. Proc. LICS’97, IEEE Press, pp. 280–291, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Cambridge Computer Laboratory, New Museums Site Pembroke St, Cambridge, CB2 3QG, UK

    James J. Leifer & Robin Milner

Authors
  1. James J. Leifer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robin Milner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory, University Park, PA, 16802-6106, USA

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leifer, J.J., Milner, R. (2000). Deriving Bisimulation Congruences for Reactive Systems. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67897-7

  • Online ISBN: 978-3-540-44618-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation