Epistemic strategies and games on concurrent processes

Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish (US)
Article number28
JournalACM Transactions on Computational Logic
Issue number4
StatePublished - Oct 2012
Externally publishedYes


  • Concurrency
  • Epistemic logic
  • Game semantics
  • Probability
  • Process algebra
  • Schedulers


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

Cite this