04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems

Recently there has been a lot of research, combining concepts of process algebra with those of the theory of graph grammars and graph transformation systems. Both can be viewed as general frameworks in which one can specify and reason about concurrent and distributed systems. There are many areas where both theories overlap and this reaches much further than just using graphs to give a graphic representation to processes. Processes in a communication network can be seen in two different ways: as terms in an algebraic theory, emphasizing their behaviour and their interaction with the environment, and as nodes (or edges) in a graph, emphasizing their topology and their connectedness. Especially topology, mobility and dynamic reconfigurations at runtime can be modelled in a very intuitive way using graph transformation. On the other hand the definition and proof of behavioural equivalences is often easier in the process algebra setting. Also standard techniques of algebraic semantics for universal constructions, refinement and compositionality can take better advantage of the process algebra representation. An important example where the combined theory is more convenient than both alternatives is for defining the concurrent (noninterleaving), abstract semantics of distributed systems. Here graph transformations lack abstraction and process algebras lack expressiveness. Another important example is the work on bigraphical reactive systems with the aim of deriving a labelled transitions system from an unlabelled reactive system such that the resulting bisimilarity is a congruence. Here, graphs seem to be a convenient framework, in which this theory can be stated and developed. So, although it is the central aim of both frameworks to model and reason about concurrent systems, the semantics of processes can have a very different flavour in these theories. Research in this area aims at combining the advantages of both frameworks and translating concepts of one theory into the other. The Dagsuthl Seminar, which took place from 06.06. to 11.06.2004, was aimed at bringing together researchers of the two communities in order to share their ideas and develop new concepts. These proceedings4 of the do not only contain abstracts of the talks given at the seminar, but also summaries of topics of central interest. We would like to thank all participants of the seminar for coming and sharing their ideas and everybody who has contributed to the proceedings.

[1]  Dániel Varró Towards Symbolic Analysis of Visual Modeling Languages , 2003, Electron. Notes Theor. Comput. Sci..

[2]  Lucian Wischik,et al.  Explicit Fusions: Theory and Implementation , 2001 .

[3]  B. König,et al.  Verifying Finite-State Graph Grammars: An Unfolding-Based Approach , 2004, CONCUR.

[4]  Reiko Heckel,et al.  Compositional Verification of Reactive Systems Specified by Graph Transformation , 1998, FASE.

[5]  Maribel Fernández,et al.  Interaction Nets with McCarthy's amb , 2002, EXPRESS.

[6]  Ugo Montanari,et al.  A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence , 2002, CONCUR.

[7]  G. Plotkin,et al.  Proof, language, and interaction: essays in honour of Robin Milner , 2000 .

[8]  Barbara König,et al.  A general framework for types in graph rewriting , 2000, Acta Informatica.

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

[10]  Arend Rensink,et al.  Canonical Graph Shapes , 2004, ESOP.

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

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

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

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

[15]  Andrea Corradini,et al.  A Static Analysis Technique for Graph Transformation Systems , 2001, CONCUR.

[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]  Ivan Lanese,et al.  A Graphical Fusion Calculus , 2004, Electron. Notes Theor. Comput. Sci..

[18]  Reiko Heckel,et al.  A Fully Abstract Model for Graph-Interpreted Temporal Logic , 1998, TAGT.

[19]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

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

[21]  Javier Esparza,et al.  Model Checking Using Net Unfoldings , 1993, Sci. Comput. Program..

[22]  Ugo Montanari,et al.  Shaped Hierarchical Architectural Design , 2004, Electron. Notes Theor. Comput. Sci..

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

[24]  Ugo Montanari,et al.  Unfolding and Event Structure Semantics for Graph Grammars , 1999, FoSSaCS.

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

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

[27]  Paolo Baldan,et al.  A Logic for Analyzing Abstractions of Graph Transformation Systems , 2003, SAS.

[28]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[29]  Paolo Baldan,et al.  Approximating the Behaviour of Graph Transformation Systems , 2002, ICGT.

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

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

[32]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).

[33]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[34]  Dan Hirsch,et al.  Graph Transformation Models for Software Architecture Styles , 2003 .

[35]  Arend Rensink,et al.  Towards model checking graph grammars , 2003 .

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

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

[38]  Prakash Panangaden,et al.  The Expressive Power of Indeterminate Dataflow Primitives , 1992, Inf. Comput..

[39]  Leila Ribeiro,et al.  Parallel composition and unfolding semantics of graph grammars , 1996 .