Decoding choice encodings

DOI10.1006/inco.2000.2868zbMath1003.68080OpenAlexW2075040560MaRDI QIDQ1854385

Benjamin C. Pierce, Uwe Nestmann

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2868

Mathematics Subject Classification ID

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

Related Items

On the expressive power of movement and restriction in pure mobile ambients, Abstractions for fault-tolerant global computing, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Linear forwarders, Coupled similarity: the first 32 years, Distinguishing and relating higher-order and first-order processes by expressiveness, Theory of interaction, On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus, Psi-calculi revisited: connectivity and compositionality, Breaking symmetries, Unnamed Item, Unnamed Item, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Towards a unified approach to encodability and separation results for process calculi, 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, A Translation of Beta-binders in a Prioritized Pi-calculus, CCS with priority guards, The \(C_\pi\)-calculus: a model for confidential name passing, On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus, Full abstraction for expressiveness: history, myths and facts, A calculus for reasoning about software composition, On the expressive power of \textsc{Klaim}-based calculi, A randomized encoding of the \(\pi\)-calculus with mixed choice, A hierarchy of equivalences for asynchronous calculi, On the interactive power of higher-order processes extended with parameterization, Comparing communication primitives via their relative expressive power, On the Relative Expressive Power of Calculi for Mobility, The λ-calculus in the π-calculus, On bisimulations for the asynchronous \(\pi\)-calculus, Unnamed Item, Types for access control, On the Expressive Power of Polyadic Synchronisation in π-calculus, Communication and mobility control in boxed ambients, On an open problem of Amadio and Curien: The finite antichain condition, What is a ``good encoding of guarded choice?, Expressiveness of Process Algebras

Uses Software

• Pict

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Bisimulation and divergence
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• An efficiency preorder for processes
• Plain CHOCS. A second generation calculus for higher order processes
• The lazy lambda calculus in a concurrency scenario
• A theory of higher order communicating systems
• On reduction-based process semantics
• Objects in the \(\pi\)-calculus
• Polarized name passing
• On the proof method for bisimulation
• Process Algebra
• Functions as processes
• From π-calculus to higher-order π-calculus — and back
• From a concurrent λ-calculus to the π-calculus
• π-Calculus semantics of object-oriented programming languages
• A foundation for higher-order concurrent constraint programming
• Barbed bisimulation
• An investigation into functions as processes
• Constraints as processes