A randomized encoding of the \(\pi\)-calculus with mixed choice

DOI10.1016/j.tcs.2004.11.020zbMath1080.68080OpenAlexW2091938608MaRDI QIDQ555750

Oltea Mihaela Herescu, Catuscia Palamidessi

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.020

zbMATH Keywords

Mixed choiceRandomized processesTesting semanticsThe \(\pi\)-calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Probabilistic and nondeterministic aspects of anonymity ⋮ Probable innocence revisited ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus ⋮ Compositional methods for information-hiding ⋮ Randomized Dining Philosophers without Fairness Assumption ⋮ A framework for analyzing probabilistic protocols and its application to the partial secrets exchange ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ Making random choices invisible to the scheduler ⋮ Unnamed Item ⋮ Compositional Methods for Information-Hiding ⋮ An expressiveness study of priority in process calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Modal logics for mobile processes
• Bisimulation and divergence
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• A calculus of mobile processes. I
• On bisimulations for the asynchronous \(\pi\)-calculus
• On abstraction and the expressive power of programming languages
• Testing equivalences for processes
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Testing equivalence for mobile processes
• On the generalized dining philosophers problem
• Real-Time Synchronization of Interprocess Communications
• Process Algebra
• Randomized Dining Philosophers without Fairness Assumption
• Testing probabilistic automata

This page was built for publication: A randomized encoding of the \(\pi\)-calculus with mixed choice