Epistemic Strategies and Games on Concurrent Processes
From MaRDI portal
Publication:5901384
DOI10.1007/978-3-540-95891-8_17zbMath1206.68211MaRDI 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
03B45: Modal logic (including the logic of norms)
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
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