Making Random Choices Invisible to the Scheduler
From MaRDI portal
Recommendations
Cited in
(16)- Probabilistic may/must testing: retaining probabilities by restricted schedulers
- Schedulers are no prophets
- Traces, Executions and Schedulers, Coalgebraically
- Safe equivalences for security properties
- Bisimulation for Demonic Schedulers
- Trace equivalence and epistemic logic to express security properties
- Practical probability: applying pGCL to lattice scheduling
- Compositional Methods for Information-Hiding
- Information hiding in probabilistic concurrent systems
- Epistemic Strategies and Games on Concurrent Processes
- Weak bisimulation for probabilistic timed automata
- Reconciling quantum theory and process equivalence via physically admissible schedulers
- Quantitative information flow for scheduler-dependent systems
- Probabilistic and nondeterministic aspects of anonymity
- Probabilistic anonymity via coalgebraic simulations
- Making random choices invisible to the scheduler
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)