Making Random Choices Invisible to the Scheduler

DOI10.1007/978-3-540-74407-8_4MaRDI QIDQ3525628zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Making random choices invisible to the scheduler
• Noninterfering schedulers. When possibilistic noninterference implies probabilistic noninterference
• Schedulers are no prophets
• Safe equivalences for security properties
• Task-structured probabilistic I/O automata

Cited in

(14)

• Trace equivalence and epistemic logic to express security properties
• Practical probability: applying pGCL to lattice scheduling
• Epistemic Strategies and Games on Concurrent Processes
• Schedulers are no prophets
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Making random choices invisible to the scheduler
• Probabilistic and nondeterministic aspects of anonymity
• Information hiding in probabilistic concurrent systems
• Traces, Executions and Schedulers, Coalgebraically
• Compositional Methods for Information-Hiding
• Weak bisimulation for probabilistic timed automata
• Safe equivalences for security properties
• Bisimulation for Demonic Schedulers
• Probabilistic anonymity via coalgebraic simulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525628)