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.
|Title of host publication||SOFSEM 2009 : Theory and Practice of Computer Science (35th Conference, Spindleruv Mlyn, Czech Republic, January 24-30, 2009, Proceedings)|
|Editors||M. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma, F. Valencia|
|Place of Publication||Berlin|
|Publication status||Published - 2009|
|Name||Lecture Notes in Computer Science|
Chatzikokolakis, K., Knight, S., & Panangaden, P. (2009). Epistemic strategies and games on concurrent processes. In M. Nielsen, A. Kucera, P. B. Miltersen, C. Palamidessi, P. Tuma, & F. Valencia (Eds.), SOFSEM 2009 : Theory and Practice of Computer Science (35th Conference, Spindleruv Mlyn, Czech Republic, January 24-30, 2009, Proceedings) (pp. 153-166). (Lecture Notes in Computer Science; Vol. 5404). Springer. https://doi.org/10.1007/978-3-540-95891-8_17