Epistemic Strategies and Games on Concurrent Processes
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 independent 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.
Unable to display preview. Download preview PDF.
- 1.Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. In: Proc. of Principles of Distributed Computing, pp. 50–61 (1984)Google Scholar
- 10.Borgstrom, J., Kramer, S., Nestmann, U.: Calculus of cryptographic communication. In: Proceedings of FCS-ARSPA 2006, pp. 91–112 (2006)Google Scholar
- 14.Krasucki, P., Ndjatou, G., Parikh, R.: Probabilistic knowledge and probabilistic common knowledge. In: ISMIS 1990, pp. 1–8. North-Holland, Amsterdam (1990)Google Scholar