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.
Type de document :
Article dans une revue
ACM Transactions on Computational Logic, Association for Computing Machinery, 2012, 13 (4), pp.28:1-28:35. 〈10.1145/2362355.2362356〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00637160
Contributeur : Catuscia Palamidessi <>
Soumis le : lundi 31 octobre 2011 - 02:54:36
Dernière modification le : mercredi 14 novembre 2018 - 16:10:03
Document(s) archivé(s) le : dimanche 4 décembre 2016 - 07:19:39

Fichier

HAL-version.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Konstantinos Chatzikokolakis, Sophia Knight, Catuscia Palamidessi, Prakash Panangaden. Epistemic Strategies and Games on Concurrent Processes. ACM Transactions on Computational Logic, Association for Computing Machinery, 2012, 13 (4), pp.28:1-28:35. 〈10.1145/2362355.2362356〉. 〈inria-00637160〉

Partager

Métriques

Consultations de la notice

768

Téléchargements de fichiers

161