Bisimulation for Demonic Schedulers
From MaRDI portal
Publication:3617738
DOI10.1007/978-3-642-00596-1_23zbMath1234.68293MaRDI QIDQ3617738
No author found.
Publication date: 31 March 2009
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_23
94A60: Cryptography
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M12: Network protocols
Related Items
Information hiding in probabilistic concurrent systems, Weak bisimulation for probabilistic timed automata, Probabilistic and nondeterministic aspects of anonymity, Making random choices invisible to the scheduler, Bisimulation for Demonic Schedulers
Cites Work
- Unnamed Item
- Analyzing security protocols using time-bounded task-PIOAs
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- A calculus for cryptographic protocols: The spi calculus
- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
- Making Random Choices Invisible to the Scheduler
- Bisimulation for Demonic Schedulers
- Mobile values, new names, and secure communication
- Programming Languages and Systems
- CONCUR 2005 – Concurrency Theory