On Synchronous and Asynchronous Interaction in Distributed Systems

When considering distributed systems, it is a central issue how to deal with interactions between components. In this paper, we investigate the paradigms of synchronous and asynchronous interaction in the context of distributed systems. We investigate to what extent or under which conditions synchronous interaction is a valid concept for specification and implementation of such systems. We choose Petri nets as our system model and consider different notions of distribution by associating locations to elements of nets. First, we investigate the concept of simultaneity which is inherent in the semantics of Petri nets when transitions have multiple input places. We assume that tokens may only be taken instantaneously by transitions on the same location. We exhibit a hierarchy of `asynchronous' Petri net classes by different assumptions on possible distributions. Alternatively, we assume that the synchronisations specified in a Petri net are crucial system properties. Hence transitions and their preplaces may no longer placed on separate locations. We then answer the question which systems may be implemented in a distributed way without restricting concurrency, assuming that locations are inherently sequential. It turns out that in both settings we find semi-structural properties of Petri nets describing exactly the problematic situations for interactions in distributed systems.

[1]  Ursula Goltz,et al.  Symmetric and Asymmetric Asynchronous Interaction , 2008, ICE@ICALP.

[2]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and the asynchronous π-calculus , 1998, POPL '97.

[3]  Martin J. M. de Boer,et al.  Construction of Map OL-Systems for Developmental Sequences of Plant Cell Layers , 1990, Graph-Grammars and Their Application to Computer Science.

[4]  Ekkart Kindler,et al.  Beyond asymmetric choice : a note on some extensions , 1998 .

[5]  L. Bourgé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988 .

[6]  Tomislav Marasović.  The Transformation of Diocletian's Palace in the City of Split as a Chronological Question , 1970 .

[7]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[8]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[9]  Frank S. de Boer,et al.  Embedding as a Tool for Language Comparison: On the CSP Hierarchy , 1991, CONCUR.

[10]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[11]  Leslie Lamport,et al.  Arbitration-free synchronization , 2003, Distributed Computing.

[12]  C. A. R. Hoare,et al.  Specification-oriented semantics for Communicating Processes , 1983, Acta Informatica.

[13]  Luc Bougé,et al.  On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes , 1988, Acta Informatica.

[14]  Daniele Gorla.  On the Relative Expressive Power of Asynchronous Communication Primitives , 2006, FoSSaCS.

[15]  P. Gács,et al.  Algorithms , 1992 .

[16]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[17]  Eike Best.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986 .

[18]  Peter Selinger,et al.  First-Order Axioms for Asynchrony , 1997, CONCUR.

[19]  Eike Best,et al.  Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets , 1983, CAAP.

[20]  Richard P. Hopkins.  Distributable nets , 1990, Applications and Theory of Petri Nets.

[21]  Dirk Taubner.  Zur verteilten Implementierung von Petrinetzen/ On the Distributed Implementation of Petri Nets , 1988, it Inf. Technol..

[22]  Eike Best,et al.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986, Advances in Petri Nets.

[23]  Wolfgang Reisig,et al.  Deterministic buffer synchronization of sequential processes , 1982, Acta Informatica.

[24]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.