Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Probabilistic knowledge and probabilistic common knowledge
Methodologies for intelligent systems, 5
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Reasoning about knowledge
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Anonymity protocols as noisy channels
Information and Computation
Bisimulation for Demonic Schedulers
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Making random choices invisible to the scheduler
Information and Computation
Combining epistemic logic and hennessy-milner logic
Logic and Program Semantics
| Hi-index | 0.00 |
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to interacting agents. We define games and strategies on process algebras, so that two agents interacting according to their strategies determine the execution of the process, replacing the traditional scheduler. We show that different restrictions on strategies represent different amounts of information being available to a scheduler. We also show that a certain class of strategies corresponds to the syntactic schedulers of Chatzikokolakis and Palamidessi, which were developed to overcome problems with traditional schedulers modelling interaction. The restrictions on these strategies have an explicit epistemic flavour.