On Synchronous and Asynchronous Interaction in Distributed Systems
Abstract
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 semistructural properties of Petri nets describing exactly the problematic situations for interactions in distributed systems.
 Publication:

arXiv eprints
 Pub Date:
 December 2008
 arXiv:
 arXiv:0901.0048
 Bibcode:
 2009arXiv0901.0048V
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Distributed;
 Parallel;
 and Cluster Computing;
 F.1.2;
 B.4.3
 EPrint:
 26 pages. An extended abstract of this paper appeared in Proceedings 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), Torun, Poland, August 2008 (E. Ochmanski &