Normal Forms for Stateless Connectors

The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in the literature at different levels of abstraction. We focus on a basic algebra of connectors which is expressive enough to model e.g. all the architectural connectors of CommUnity. We first define the operational, observational and denotational semantics of connectors, then we show that the observational and denotational semantics coincide and finally we give a complete normal-form axiomatization.

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

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

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

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

[5]  Roberto Bruni,et al.  Normal Forms for Partitions and Relations , 1998, WADT.

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

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

[8]  Gheorghe Stefanescu,et al.  Towards a new algebraic foundation of flowchart scheme theory , 1990 .

[9]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

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

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

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

[13]  Jan A. Bergstra,et al.  Network algebra for asynchronous dataflow , 1997, Int. J. Comput. Math..

[14]  Yves Lafont.  Interaction Combinators , 1997, Inf. Comput..

[15]  José Luiz Fiadeiro.  Categories for software engineering , 2005 .

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

[17]  Michel Wermelinger,et al.  A Mathematical Semantics for Architectural Connectors , 2003, Generic Programming.

[18]  Cristian S. Calude,et al.  Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

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

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

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