Bigraphs and transitions

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 λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.

[1]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences: A 2-categorical Approach , 2002, EXPRESS.

[2]  Peter Sewell,et al.  From rewrite rules to bisimulation congruences , 2002, Theor. Comput. Sci..

[3]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[4]  Ugo Montanari,et al.  Synchronized Hyperedge Replacement with Name Mobility , 2001, CONCUR.

[5]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[6]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[7]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[8]  Philippa Gardner,et al.  From Process Calculi to Process Frameworks , 2000, CONCUR.

[9]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[10]  Berthold Hoffmann,et al.  Hierarchical Graph Transformation , 2000, J. Comput. Syst. Sci..

[11]  Peter Sewell,et al.  Nomadic Pict: language and infrastructure design for mobile agents , 1999, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents.

[12]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[13]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[14]  Fabio Gadducci,et al.  An inductive view of graph transformation , 1997, WADT.

[15]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[16]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[17]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[18]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[19]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[20]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[21]  Hartmut Ehrig,et al.  Bigraphs meet Double Pushouts , 2002, Bull. EATCS.

[22]  James J. Leifer,et al.  Operational congruences for reactive systems , 2001 .

[23]  Robin Milner,et al.  Bigraphical reactive systems: basic theory , 2001 .

[24]  Robin Milner,et al.  Contexts and embeddings for closed shallow action graphs , 2000 .

[25]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[26]  R. Milner.  Calculi for interaction , 1996, Acta Informatica.