Skip to main content

Bigraphical Reactive Systems

  • Conference paper
  • First Online:
CONCUR 2001 — Concurrency Theory (CONCUR 2001)

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

Included in the following conference series:


A notion of bigraph is introduced as a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and an edge net representing connectivity. Bigraphs arc equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the π-calculus and the ambient calculus. A behavioural theory is established, using the categorical notion of relative pushout; it allows labelled transition systems to be derived uniformly for a wide variety of BRSs, in such a way that familiar behavioural prcordcrs and equivalences, in particular bisimilarity, are congruential. An example of the derivation is discussed.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Berry, G. and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science, Vol 96, pp217 248.

    Article  MathSciNet  Google Scholar 

  2. Cardclli, L. and Gordon, A.D. (2000), Mobile ambicnts. Foundations of System Specification and Computational Structures, LNCS 1378, pp140–155.

    Google Scholar 

  3. Cattani, G.L., Lcifcr, J.J. and Milncr, R. (2000), Contexts and Embcddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496. [Submitted for publication.] Available at

  4. Gardner, P.A. (2000), From process calculi to process frameworks. Proc. CON-CUR 2000, 11th International Conference on Concurrency theory, pp69–88.

    Google Scholar 

  5. Gardner, P.A. and Wischik, L. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893, pp373–383.

    Google Scholar 

  6. Hasegawa, M. (1999) Models of sharing graphs. Distinguished Dissertation Series, Springer-Verlag.

    Google Scholar 

  7. Lafont, Y. (1990), Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL 90), pp95–108.

    Google Scholar 

  8. Leiter, J.J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory.

    Google Scholar 

  9. Leiter, J.J. and Millier, R. (2000), Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory, pp243–258. Available at

  10. Milner, R. (1996), Calculi for interaction. Acta Informatica 33, pp707–737.

    Article  MathSciNet  Google Scholar 

  11. Milner, R. (2001), Digraphs. Forthcoming Technical Report, University of Cambridge Computer Laboratory.

    Google Scholar 

  12. Milncr, R., Parrow, J. and Walker D. (1992), A calculus of mobile processes. Parts I and II. Journal of Information and Computation, Vol 100, pp1–40 arid pp41–77.

    Article  Google Scholar 

  13. Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS’98, IEEE Computer Society Press.

    Google Scholar 

  14. Pctri, C.A. (1962), Fundamentals of a theory of asynchronous information flow. Proc. IFIP Congress’ 62, North Holland, pp386–390.

    Google Scholar 

  15. Scwcll, P. (1998), From rewrite rules to bisimulation congruences. Proc CON-CUR’98, LNCS 1466, pp269 284. Full version to appear in Theoretical Computer Science, Vol 272/1-2.

    Google Scholar 

  16. Wojciechowski, P.T. and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. Proc. ASA/MA’ 99, Palm Springs, California.

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Milner, R. (2001). Bigraphical Reactive Systems. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics