Observational congruences for dynamically reconfigurable tile systems

The SOS formats that ensure that bisimilarity is a congruence tail in the presence ot structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the 'bisimilarity is a congruence' property with structural axioms and also with the specification of open ended systems, where states can be reconfigured at runtime. We show that the compositional framework offered by tile logic handles structural axioms and specifications of reconfigurable systems successfully. This allows for a finitary presentation of dynamic context closure, as internalized in the tile language. The case study of the π-calculus illustrates the main features of our approach. Moreover, duality is exploited to model a second kind of reconfiguration: dynamic specialization.

[1]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

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

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

[4]  Fabio Gadducci,et al.  Comparing logics for rewriting: rewriting logic, action calculi and tile logic , 2002, Theor. Comput. Sci..

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

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

[7]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[8]  Gian Luigi Ferrari,et al.  Tile Formats for Located and Mobile Systems , 2000, Inf. Comput..

[9]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

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

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

[12]  Arend Rensink,et al.  Bisimilarity of open terms , 1999, EXPRESS.

[13]  Roberto Bruni,et al.  Dynamic connectors for concurrency , 2002, Theor. Comput. Sci..

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

[15]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[16]  Reiko Heckel,et al.  From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence , 1999, CMCS.

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

[18]  Roberto Bruni,et al.  Open Ended Systems, Dynamic Bisimulation and Tile Logic , 2000, IFIP TCS.

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

[20]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[21]  Roberto Bruni,et al.  Executable Tile Specifications for Process Calculi , 1999, FASE.

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

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

[24]  Roberto Bruni,et al.  Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic , 2000, CONCUR.

[25]  José Meseguer,et al.  Mapping tile logic into rewriting logic , 1997, WADT.

[26]  Reiko Heckel,et al.  Tile Transition Systems as Structured Coalgebras , 1999, FCT.

[27]  Chris Reade.  "Proof, Language and Interaction, Essays in Honour of Robin Milner" by Gordon Plotkin, Colin Sterling and Mads Tofte (eds.), Foundations of Computing Series, MIT Press 2000 , 2000, J. Funct. Program..

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

[29]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[30]  Roberto Bruni,et al.  Generalized Rewrite Theories , 2003, ICALP.

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

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

[33]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[34]  Ugo Montanari,et al.  An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs , 1992, Theor. Comput. Sci..

[35]  Roberto Bruni,et al.  Symmetric monoidal and cartesian double categories as a semantic framework for tile logic , 2002, Mathematical Structures in Computer Science.

[36]  Roberto Bruni,et al.  Bisimulation by Unification , 2002, AMAST.

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

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

[39]  Robin Milner.  The Polyadic Pi-calculus (Abstract) , 1992, CONCUR.

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

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

[42]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

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

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

[45]  Roberto Bruni,et al.  Cartesian closed double categories, their lambda-notation, and the pi-calculus , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[46]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.