Epistemic Strategies and Games on Concurrent Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2012

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 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 flavor.
Fichier principal
Vignette du fichier
HAL-version.pdf (519.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00637160 , version 1 (31-10-2011)



Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. ACM Transactions on Computational Logic, 2012, 13 (4), pp.28:1-28:35. ⟨10.1145/2362355.2362356⟩. ⟨inria-00637160⟩
414 View
169 Download



Gmail Facebook X LinkedIn More