Synchronous Multiparty Synchronizations and Transactions

In this paper we analyze how a powerful synchronization mechanism such as synchronous multiparty synchronizations, which is able to specify atomic reconfigurations of large systems, can be implemented using binary synchronizations combined with a transactional mechanism. To this aim we show a mapping from SHR, a graph transformation framework allowing multiparty synchronizations, to a generalization of Fusion Calculus featuring a transactional mechanism inspired by the Zero-Safe Petri nets. To complete the correspondence between the two formalisms we also present a mapping in the opposite direction.

[1]  Ivan Lanese,et al.  Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility , 2006, Electron. Notes Theor. Comput. Sci..

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

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

[4]  Roberto Bruni,et al.  Concurrent models for Linda with transactions , 2004, Math. Struct. Comput. Sci..

[5]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[6]  Ivan Lanese,et al.  Synchronization Strategies for Global Computing Models , 2006 .

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

[8]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

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

[10]  Cosimo Laneve,et al.  Foundations of Web Transactions , 2005, FoSSaCS.

[11]  Laura Bocchi,et al.  A Process Calculus of Atomic Commit , 2004, Electron. Notes Theor. Comput. Sci..

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

[13]  Laura Bocchi,et al.  A Calculus for Long-Running Transactions , 2003, FMOODS.

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

[15]  Chris Hankin,et al.  Coordinatio Languages and Models , 2002, Lecture Notes in Computer Science.

[16]  Roberto Gorrieri,et al.  A2CCKS: Atomic Actions for CCS , 1990, Theor. Comput. Sci..

[17]  Ugo Montanari,et al.  Graph Grammars for distributed systems , 1982, Graph-Grammars and Their Application to Computer Science.

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

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

[20]  Roberto Bruni,et al.  Nested Commits for Mobile Calculi: Extending Join , 2004, IFIP TCS.

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

[22]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

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

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