Bigraphical Reactive Systems

  • Robin Milner
Conference paper

DOI: 10.1007/3-540-44685-0_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2154)
Cite this paper as:
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

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

Personalised recommendations