Is It a “Good” Encoding of Mixed Choice?

DOI10.1007/978-3-642-28729-9_14zbMath1352.68190OpenAlexW1824051602MaRDI QIDQ2892772

Kirstin Peters, Uwe Nestmann

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28729-9_14

Mathematics Subject Classification ID

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

Related Items (14)

Session-based concurrency, declaratively ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Psi-calculi revisited: connectivity and compositionality ⋮ Breaking symmetries ⋮ Synchrony versus causality in distributed systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Operational semantics of a weak memory model with channel synchronization ⋮ Unnamed Item

This page was built for publication: Is It a “Good” Encoding of Mixed Choice?