Making random choices invisible to the scheduler

DOI10.1016/j.ic.2009.06.006zbMath1205.68239OpenAlexW2096009691MaRDI QIDQ979081

Catuscia Palamidessi, Konstantinos Chatzikokolakis

Publication date: 25 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ic.2009.06.006

Mathematics Subject Classification ID

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

Related Items (3)

Modular verification of protocol equivalence in the presence of randomness ⋮ Approximate counting in SMT and value estimation for probabilistic programs ⋮ Compositional methods for information-hiding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• A calculus for cryptographic protocols: The spi calculus
• Testing equivalences for processes
• Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
• On Recursion, Replication and Scope Mechanisms in Process Calculi
• Bisimulation for Demonic Schedulers
• Validation of Stochastic Systems
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Epistemic Strategies and Games on Concurrent Processes

This page was built for publication: Making random choices invisible to the scheduler