Bigraphical Reactive Systems

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 are 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 preorders and equivalences, in particular bisimilarity, are congruential. An example of the derivation is discussed.

[1]  Peter Sewell,et al.  From Rewrite to Bisimulation Congruences , 1998, CONCUR.

[2]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

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

[5]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[6]  Robin Milner,et al.  Shallow Linear Action Graphs and their Embeddings , 2002, Formal Aspects of Computing.

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

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

[9]  Masahito Hasegawa,et al.  Models of Sharing Graphs , 1999, Distinguished Dissertations.

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

[11]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

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

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

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

[15]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[16]  C. A. Petri.  Fundamentals of a Theory of Asynchronous Information Flow , 1962, IFIP Congress.

[17]  Nobuko Yoshida.  Graph Notation for Concurrent Combinators , 1994, Theory and Practice of Parallel Programming.

[18]  Yu. A. Gur'yan,et al.  Parts I and II , 1982 .

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

[20]  Berthold Hoffmann,et al.  Hierarchical Graph Transformation , 2002, J. Comput. Syst. Sci..

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

[22]  Peter Sewell,et al.  Nomadic pict: correct communication infrastructure for mobile computation , 2001, POPL '01.

[23]  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).

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