Epistemic Strategies and Games on Concurrent Processes

Konstantinos Chatzikokolakis 1, 2 Sophia Knight Prakash Panangaden
2 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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 ow in the interactions between agents and to control the information available to interacting agents. We dene games and strategies on process algebras, so that two agents interacting according to their strategies determine the execution of the process, re- placing the traditional scheduler. We show that dierent restrictions on strategies represent dierent 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 mod- elling interaction. The restrictions on these strategies have an explicit epistemic avour.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00424854
Contributor : Catuscia Palamidessi <>
Submitted on : Monday, October 19, 2009 - 6:03:45 AM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM
Long-term archiving on : Tuesday, October 16, 2012 - 12:26:49 PM

File

games_sofsem09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00424854, version 1

Collections

Citation

Konstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. SOFSEM 2009, Jan 2009, Špindlerův Mlýn, Czech Republic. pp.153-166. ⟨inria-00424854⟩

Share

Metrics

Record views

291

Files downloads

149