Skip to Main content Skip to Navigation
New interface
Journal articles

Epistemic Strategies and Games on Concurrent Processes

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi Connect in order to contact the contributor
Submitted on : Monday, October 31, 2011 - 2:54:36 AM
Last modification on : Wednesday, February 2, 2022 - 3:57:15 PM
Long-term archiving on: : Sunday, December 4, 2016 - 7:19:39 AM


Files produced by the author(s)




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⟩



Record views


Files downloads