On Graph(ic) Encodings

This paper is an informal summary of different encoding techniques from process calculi and distributed formalisms to graphic frameworks. The sur- vey includes the use of solo diagrams, term graphs, synchronized hyperedge re- placement systems, bigraphs, tile models and interactive systems, all presented at the Dagstuhl Seminar 04241. The common theme of all techniques recalled here is having a graphic presentation that, at the same time, gives both an intuitive vi- sual rendering (of processes, states, etc.) and a rigorous mathematical framework.

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

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

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

[4]  Roberto Bruni,et al.  Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic , 2002, TOSCA.

[5]  Fabio Gadducci,et al.  A Concurrent Graph Semantics for Mobile Ambients , 2001, MFPS.

[6]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[7]  Marco Pistore,et al.  Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”. , 1995 .

[8]  Arend Rensink.  Bisimilarity of open terms , 1997, EXPRESS.

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

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

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

[12]  Cosimo Laneve,et al.  Solo Diagrams , 2001, TACS.

[13]  José Luiz Fiadeiro,et al.  Categorical Semantics of Parallel Program Design , 1997, Sci. Comput. Program..

[14]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[15]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

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

[17]  Ugo Montanari,et al.  D-Fusion: A Distinctive Fusion Calculus , 2004, APLAS.

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

[19]  Robin Milner.  Pi-Nets: A Graphical Form of pi-Calculus , 1994, ESOP.

[20]  Joachim Parrow.  Interaction Diagrams , 1995, Nord. J. Comput..

[21]  Paola Inverardi,et al.  Reconfiguration of Software Architecture Styles with Name Mobility , 2000, COORDINATION.

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

[23]  Fabio Gadducci,et al.  An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories , 1999, Appl. Categorical Struct..

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

[25]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

[27]  Ugo Montanari,et al.  A model for distributed systems based on graph rewriting , 1987, JACM.

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

[29]  Cosimo Laneve,et al.  Solos in Concert , 1999, ICALP.

[30]  R. Bruni.  Tile Logic for Synchronized Rewriting of Concurrent Systems , 1999 .

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

[32]  Ivan Lanese,et al.  A Graphical Fusion Calculus , 2004, Electron. Notes Theor. Comput. Sci..

[33]  Detlef Plump,et al.  Term graph rewriting , 1999 .

[34]  Gheorghe Stefanescu,et al.  Interactive Systems with Registers and Voices , 2006, Fundam. Informaticae.

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

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

[37]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[38]  Fabio Gadducci,et al.  Term Graph Rewriting for the pi-Calculus , 2003, APLAS.

[39]  Hartmut Ehrig,et al.  Concurrent semantics of algebraic graph transformations , 1999 .

[40]  Ivan Lanese,et al.  Synchronization Algebras with Mobility for Graph Transformations , 2005, FGUC.

[41]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[42]  Ron Dinishak.  The optimal implementation of functional programming languages , 2000, SOEN.

[43]  Emilio Tuosto,et al.  A LTS Semantics of Ambients via Graph Synchronization with Mobility , 2001, ICTCS.

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

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

[46]  Roberto Bruni,et al.  New Insights on Architectural Connectors , 2004, IFIP TCS.

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

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

[49]  Barbara König.  A Graph Rewriting Semantics for the Polyadic Calculus , 2000, ICALP Satellite Workshops.

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

[51]  John Lamping,et al.  An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[52]  Marco Pistore,et al.  Concurrent semantics for the pi-calculus , 1995, MFPS.