What is a ``good encoding of guarded choice?
From MaRDI portal
Publication:1854329
DOI10.1006/inco.1999.2822zbMath1046.68625OpenAlexW2029133311MaRDI QIDQ1854329
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/68aaf1392aea2c94d3ddb28bd4d729f950486741
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (37)
On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Theory of interaction ⋮ Unnamed Item ⋮ Breaking symmetries ⋮ Synchrony versus causality in distributed systems ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Unnamed Item ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ Separation of synchronous and asynchronous communication via testing ⋮ Symmetric electoral systems for ambient calculi ⋮ On the expressiveness of interaction ⋮ Symmetric and Asymmetric Asynchronous Interaction ⋮ A typed encoding of boxed into safe ambients ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ Termination in higher-order concurrent calculi ⋮ Stochastic biological modelling in the presence of multiple compartments ⋮ On the relative expressiveness of higher-order session processes ⋮ On Synchronous and Asynchronous Interaction in Distributed Systems ⋮ Ensuring termination by typability ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Comparing communication primitives via their relative expressive power ⋮ Unnamed Item ⋮ A thesis for interaction ⋮ An expressiveness study of priority in process calculi ⋮ Communication and mobility control in boxed ambients ⋮ On an open problem of Amadio and Curien: The finite antichain condition ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS ⋮ Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus ⋮ Expressiveness of Process Algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
- A calculus of mobile processes. II
- On bisimulations for the asynchronous \(\pi\)-calculus
- An efficiency preorder for processes
- On the \(\pi\)-calculus and linear logic
- A counter-example to an algorithm for the generalized input--output construct of CSP
- On modelling mobility
- Decoding choice encodings
- The name discipline of uniform receptiveness
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- A new solution of Dijkstra's concurrent programming problem
- Barbed bisimulation
- Constraints as processes
This page was built for publication: What is a ``good encoding of guarded choice?
