Bigraphical Reactive Systems

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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Berry, G. and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science, Vol 96, pp217 248.CrossRefMathSciNetGoogle Scholar
  2. [2]
    Cardclli, L. and Gordon, A.D. (2000), Mobile ambicnts. Foundations of System Specification and Computational Structures, LNCS 1378, pp140–155.Google Scholar
  3. [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. [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. [5]
    Gardner, P.A. and Wischik, L. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893, pp373–383.Google Scholar
  6. [6]
    Hasegawa, M. (1999) Models of sharing graphs. Distinguished Dissertation Series, Springer-Verlag.Google Scholar
  7. [7]
    Lafont, Y. (1990), Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL 90), pp95–108.Google Scholar
  8. [8]
    Leiter, J.J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory.Google Scholar
  9. [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. [10]
    Milner, R. (1996), Calculi for interaction. Acta Informatica 33, pp707–737.CrossRefMathSciNetGoogle Scholar
  11. [11]
    Milner, R. (2001), Digraphs. Forthcoming Technical Report, University of Cambridge Computer Laboratory.Google Scholar
  12. [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.CrossRefGoogle Scholar
  13. [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. [14]
    Pctri, C.A. (1962), Fundamentals of a theory of asynchronous information flow. Proc. IFIP Congress’ 62, North Holland, pp386–390.Google Scholar
  15. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Robin Milner
    • 1
  1. 1.University of Cambridge Computer LaboratoryCambridgeUK

Personalised recommendations