Bisimulation for Demonic Schedulers

DOI10.1007/978-3-642-00596-1_23zbMath1234.68293OpenAlexW1888841230MaRDI 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

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items (6)

Probabilistic and nondeterministic aspects of anonymity ⋮ Weak bisimulation for probabilistic timed automata ⋮ Information flow in systems with schedulers. II: Refinement ⋮ Information hiding in probabilistic concurrent systems ⋮ 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

This page was built for publication: Bisimulation for Demonic Schedulers