Synchrony versus causality in distributed systems
From MaRDI portal
Publication:2971080
DOI10.1017/S0960129514000644zbMath1362.68220MaRDI QIDQ2971080
Goltz, Ursula, Jens-Wolfhard Schicke-Uffmann, Kirstin Peters, Uwe Nestmann
Publication date: 4 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (3)
Cites Work
- Comparing communication primitives via their relative expressive power
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Non-interleaving semantics for mobile processes
- Distributing finite automata through Petri net synthesis
- What is a ``good encoding of guarded choice?
- Towards a unified approach to encodability and separation results for process calculi
- Expressiveness of Process Algebras
- Is It a “Good” Encoding of Mixed Choice?
- On Distributability of Petri Nets
- On Synchronous and Asynchronous Interaction in Distributed Systems
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: Synchrony versus causality in distributed systems
