Bigraphs as a Model for Mobile Interaction

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.

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

[2]  Robin Milner,et al.  Bigraphs and transitions , 2003, POPL '03.

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

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

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

[6]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

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

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

[9]  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.

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

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

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

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