Breaking symmetries

DOI10.1017/S0960129514000346zbMath1362.68219arXiv1011.6437OpenAlexW4236642273MaRDI QIDQ2971075

Uwe Nestmann, Kirstin Peters

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.6437

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Mixed Sessions, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Distributability of mobile ambients, Unnamed Item, The Expressive Power of Monotonic Parallel Composition, Mixed sessions

Cites Work

• On the expressiveness of interaction
• Comparing communication primitives via their relative expressive power
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A calculus of mobile processes. I
• A counter-example to an algorithm for the generalized input--output construct of CSP
• On the expressiveness of Linda coordination primitives.
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Towards a unified approach to encodability and separation results for process calculi
• Tutorial on separation results in process calculi via leader election problems
• Expressiveness of Process Algebras
• Is It a “Good” Encoding of Mixed Choice?
• An Effective Implementation for the Generalized Input-Output Construct of CSP
• Comments on “Communicating Sequential Processes”
• Communicating sequential processes
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi