Reactive systems over cospans

The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for semantic models with an underlying reduction semantics. The derivation procedure requires the presence of certain colimits (or, more usually and generally, bicolimits) which need to be constructed separately within each model. In this paper, we offer a general construction of such bicolimits in a class of bicategones of cospans. The construction sheds light on as well as extends Ehrig and Konig's rewriting via borrowed contexts and opens the way to a unified treatment of several applications.

[1]  Pawel Sobocinski,et al.  Adhesive Categories , 2004, FoSSaCS.

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

[3]  J. Benabou.  Introduction to bicategories , 1967 .

[4]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences using 2-categories , 2003, Nord. J. Comput..

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

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

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

[8]  Saunders MacLane,et al.  Coherence for bicategories and indexed categories , 1985 .

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

[10]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences: 2-Categories Vs Precategories , 2003, FoSSaCS.

[11]  Nicoletta Sabadini,et al.  Bicategories of processes , 1997 .

[12]  Reiko Heckel,et al.  Compositional Modeling of Reactive Systems Using Open Nets , 2001, CONCUR.

[13]  Vladimiro Sassone,et al.  A Congruence for Petri Nets , 2005, PNGT@ICGT.

[14]  Pawel Sobocinski.  Deriving process congruences from reaction rules , 2004 .

[15]  Hartmut Ehrig,et al.  Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting , 2004, FoSSaCS.

[16]  Robin Milner,et al.  Bigraphs for Petri Nets , 2003, Lectures on Concurrency and Petri Nets.

[17]  Robin Milner,et al.  Bigraphs and mobile processes , 2003 .

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

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

[20]  Vladimiro Sassone,et al.  Congruences for Contextual Graph-Rewriting , 2004 .