Skip to main content

Bigraphs as a Model for Mobile Interaction

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2002)

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

Included in the following conference series:

Abstract

A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including the π-calculus. This short essay explains how bigraphs compose, and uses the π-calculus to illustrate how they already provide elements of a unifying theory for calculi of mobile interactive processes.

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

Access this chapter

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cardelli, L., Gordon, A.D.: Mobile ambients. Foundations of system specification and computational structures, LNCS 1378 (2000) 140–155

    Google Scholar 

  2. Cattani, G.L., Leifer, J.J., Milner, R.: Contexts and embeddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496 (2000). [Submitted for publication.] Available at http://pauillac.inria.fr/~leifer

  3. Ehrig, H.: Introduction to the theory of graph grammars. Graph Grammars and their Application to Computer Science and Biology, LNCS 73, Springer Verlag (1979) 1–69

    Chapter  Google Scholar 

  4. Ehrig, H.: Bigraphs meet double pushouts. To appear in Bulletin of EATCS (2002)

    Google Scholar 

  5. Gardner, P.A.: From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory (2000) 69–88

    Google Scholar 

  6. Jensen, O.H., Milner, R.: Bigraphs and transitions. Submitted for publication (2002).

    Google Scholar 

  7. Jensen, O.H., Milner, R.: Forthcoming Technical Report, University of Cambridge Computer Laboratory and Univerity of Aalborg Computer Science Department (2002)

    Google Scholar 

  8. Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory (2000) 243–258. Available at http://pauillac.inria.fr/~leifer.

  9. Milner, R.: Calculi for interaction. Acta Informatica 33 (1996) 707–737

    Article  MathSciNet  Google Scholar 

  10. Milner, R.: Bigraphical reactive systems. CONCUR 2001, Proc. 12th International Conference in Concurrency Theory, LNCS 2154 (2001) 16–35

    Chapter  Google Scholar 

  11. Milner, R.: Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory (2001). Available from http://www.cl.cam.ac.uk/~rm135.

  12. Milner, R., Parrow, J., Walker D.: A calculus of mobile processes, Parts I and II. Journal of Information and Computation, Vol 100 (1992) 1–40 and 41–77

    Article  MATH  MathSciNet  Google Scholar 

  13. Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science, Vol 274(1–2) (2002) 183–230

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Milner, R. (2002). Bigraphs as a Model for Mobile Interaction. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45832-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45832-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics