Specification-oriented semantics for communicating processes
Acta Informatica
Structure theory of Petri nets: the free choice hiatus
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
First-Order Axioms for Asynchrony
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Embedding as a Tool for Language Comparison: On the CSP Hierarchy
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Arbitration-free synchronization
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Symmetric and Asymmetric Asynchronous Interaction
Electronic Notes in Theoretical Computer Science (ENTCS)
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On distributability of petri nets
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Hi-index | 0.00 |
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.