Bigraphs and Their Algebra

Bigraphs are a framework in which both existing process calculi and new models of behaviour can be formulated, yielding theory that is shared among these models. A short survey of the main features of bigraphs is presented, showing how they can be developed from standard graph theory using elementary category theory. The algebraic manipulation of bigraphs is outlined with the help of illustrations. The treatment of dynamics is then summarised. Finally, origins and some related work are discussed. The paper provides a motivating introduction to bigraphs.

[1]  Robin Milner,et al.  Matching of Bigraphs , 2007, GT-VC@CONCUR.

[2]  Robin Milner,et al.  Transition systems, link graphs and Petri nets , 2006, Mathematical Structures in Computer Science.

[3]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

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

[5]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

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

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

[8]  Lars Birkedal,et al.  Axiomatizing Binding Bigraphs , 2006, Nord. J. Comput..

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

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

[11]  Vladimiro Sassone,et al.  Spatial Logics for Bigraphs , 2005, ICALP.

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

[13]  Vladimiro Sassone,et al.  Typed polyadic pi-calculus in bigraphs , 2006, PPDP '06.

[14]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[15]  Robin Milner,et al.  Stochastic Bigraphs , 2008, MFPS.

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

[17]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[18]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

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

[20]  Reiko Heckel,et al.  A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting , 1999, CTCS.

[21]  Vladimiro Sassone,et al.  Bigraphical Logics for XML , 2005, SEBD.

[22]  Martin Olsen,et al.  Formalising Business Process Execution with Bigraphs and Reactive XML , 2006, COORDINATION.

[23]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

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

[25]  Robin Milner,et al.  Axioms for bigraphical structure , 2005, Mathematical Structures in Computer Science.

[26]  Aviv Regev,et al.  Representation and Simulation of Biochemical Processes Using the pi-Calculus Process Algebra , 2000, Pacific Symposium on Biocomputing.