Bigraphs as a Model for Mobile Interaction

  • Robin Milner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2505)

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.

Keywords

Label Transition System Graph Grammar Mobile Process Reaction Rule Short Essay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cardelli, L., Gordon, A.D.: Mobile ambients. Foundations of system specification and computational structures, LNCS 1378 (2000) 140–155Google Scholar
  2. 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. 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–69CrossRefGoogle Scholar
  4. 4.
    Ehrig, H.: Bigraphs meet double pushouts. To appear in Bulletin of EATCS (2002)Google Scholar
  5. 5.
    Gardner, P.A.: From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory (2000) 69–88Google Scholar
  6. 6.
    Jensen, O.H., Milner, R.: Bigraphs and transitions. Submitted for publication (2002).Google Scholar
  7. 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. 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. 9.
    Milner, R.: Calculi for interaction. Acta Informatica 33 (1996) 707–737CrossRefMathSciNetGoogle Scholar
  10. 10.
    Milner, R.: Bigraphical reactive systems. CONCUR 2001, Proc. 12th International Conference in Concurrency Theory, LNCS 2154 (2001) 16–35CrossRefGoogle Scholar
  11. 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. 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–77MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science, Vol 274(1–2) (2002) 183–230MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Robin Milner
    • 1
  1. 1.The Computer LaboratoryCambridge UniversityCambridgeUK

Personalised recommendations