Epistemic Strategies and Games on Concurrent Processes

DOI10.1007/978-3-540-95891-8_17zbMath1206.68211OpenAlexW2152632857MaRDI QIDQ5901384

Konstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Making random choices invisible to the scheduler

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
• Making Random Choices Invisible to the Scheduler
• Anonymity Protocols as Noisy Channels
• Games and full completeness for multiplicative linear logic
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Epistemic Strategies and Games on Concurrent Processes