Epistemic strategies and games on concurrent processes

K. Chatzikokolakis, S. Knight, P. Panangaden

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationSOFSEM 2009 : Theory and Practice of Computer Science (35th Conference, Spindleruv Mlyn, Czech Republic, January 24-30, 2009, Proceedings)
EditorsM. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma, F. Valencia
Place of PublicationBerlin
ISBN (Print)978-3-540-95890-1
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Epistemic strategies and games on concurrent processes'. Together they form a unique fingerprint.

Cite this