Making Random Choices Invisible to the Scheduler

DOI10.1007/978-3-540-74407-8_4zbMath1151.68517OpenAlexW2790189419MaRDI QIDQ3525628

Konstantinos Chatzikokolakis, Catuscia Palamidessi

Publication date: 18 September 2008

Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Traces, Executions and Schedulers, Coalgebraically ⋮ Trace Equivalence and Epistemic Logic to Express Security Properties ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Weak bisimulation for probabilistic timed automata ⋮ Probabilistic may/must testing: retaining probabilities by restricted schedulers ⋮ Information hiding in probabilistic concurrent systems ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ Bisimulation for Demonic Schedulers ⋮ Compositional Methods for Information-Hiding ⋮ Epistemic Strategies and Games on Concurrent Processes

This page was built for publication: Making Random Choices Invisible to the Scheduler