Transition systems, link graphs and Petri nets

A framework is defined within which reactive systems can be studied formally. The framework is based on s-categories, which are a new variety of categories within which reactive systems can be set up in such a way that labelled transition systems can be uniformly extracted. These lead in turn to behavioural preorders and equivalences, such as the failures preorder (treated elsewhere) and bisimilarity, which are guaranteed to be congruential. The theory rests on the notion of relative pushout, which was previously introduced by the authors.The framework is applied to a particular graphical model, known as link graphs, which encompasses a variety of calculi for mobile distributed processes. The specific theory of link graphs is developed. It is then applied to an established calculus, namely condition-event Petri nets.In particular, a labelled transition system is derived for condition-event nets, corresponding to a natural notion of observable actions in Petri-net theory. The transition system yields a congruential bisimilarity coinciding with one derived directly from the observable actions. This yields a calibration of the general theory of reactive systems and link graphs against known specific theories.

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

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

[3]  C.-H. Luke Ong,et al.  Full Abstraction in the Lazy Lambda Calculus , 1993, Inf. Comput..

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

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

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

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

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

[9]  Vladimiro Sassone,et al.  Characterizing Behavioural Congruences for Petri Nets , 1995, CONCUR.

[10]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[11]  Julian Rathke,et al.  Towards a theory of bisimulation for local names , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

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

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  Luís Caires.  Behavioral and Spatial Observations in a Logic for the pi-Calculus , 2004, FoSSaCS.

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

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

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

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

[19]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.

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

[21]  Gérard Boudol,et al.  Asynchrony and the Pi-calculus , 1992 .

[22]  Ugo Montanari,et al.  Synchronized Hyperedge replacement with name mobility: A graphical calculus for mobile Systems , 2001 .

[23]  Howard Smith,et al.  Business Process Management: The Third Wave , 2003 .

[24]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

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

[26]  Robin Milner,et al.  Bigraphs and mobile processes (revised): Technical report 580 , 2004 .

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

[28]  真人 長谷川.  Models of sharing graphs : a categorical semantics of let and letrec , 1999 .

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

[30]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[31]  Corrado Priami,et al.  Application of a stochastic name-passing calculus to representation and simulation of molecular processes , 2001, Inf. Process. Lett..

[32]  Roberto Bruni,et al.  Normal forms for algebras of connection , 2002, Theor. Comput. Sci..

[33]  Hosung Song,et al.  The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems , 2003, HSCC.

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

[35]  Lutz Priese,et al.  A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets , 1998, Theor. Comput. Sci..

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

[37]  Carla Simone,et al.  A survey of equivalence notions for net based systems , 1992, Advances in Petri Nets: The DEMON Project.

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

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

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

[41]  Matthew Hennessy,et al.  Bisimulation congruences in safe ambients , 2002, POPL '02.

[42]  Roberto Bruni,et al.  Observational congruences for dynamically reconfigurable tile systems , 2005, Theor. Comput. Sci..

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

[44]  Robin Milner.  Computational flux , 2001, POPL '01.

[45]  Karen L. Bernstein.  A congruence theorem for structured operational semantics of higher-order languages , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[46]  Philippa Gardner,et al.  Explicit Fusions , 2000, MFCS.

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

[48]  Corrado Priami,et al.  Stochastic pi-Calculus , 1995, Comput. J..

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

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

[51]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[52]  Ilaria Castellani,et al.  Process Algebras with Localities , 2001, Handbook of Process Algebra.

[53]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

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

[55]  Robin Milner,et al.  Pure bigraphs , 1993 .

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

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

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

[59]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[60]  Roberto Bruni,et al.  An interactive semantics of logic programming , 2001, Theory and Practice of Logic Programming.

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

[62]  Ugo Montanari,et al.  Dynamic congruence vs. progressing bisimulation for CCS , 1992, Fundam. Informaticae.

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

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

[65]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[66]  Jan Friso Groote,et al.  Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) , 1989, ICALP.

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

[68]  Maciej Koutny,et al.  The Box Algebra - A Model of Nets and Process Expressions , 1999, ICATPN.