Automata Techniques for Epistemic Protocol Synthesis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Automata Techniques for Epistemic Protocol Synthesis


In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning. To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial epistemic model yields a relational structure that can be finitely represented with automata. This correspondence, together with recent results on uniform strategies, allows us to give an alternative decidability proof of the epistemic planning problem for propositional events, with as by-products accurate upper-bounds on its time complexity, and the possibility to synthesize a finite word automaton that describes the set of all solution plans. In fact, using automata techniques enables us to solve a much more general problem, that we introduce and call epistemic protocol synthesis.
Fichier principal
Vignette du fichier
SR2014.pdf (98.99 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01098740 , version 1 (07-09-2015)



Guillaume Aucher, Bastien Maubert, Sophie Pinchinat. Automata Techniques for Epistemic Protocol Synthesis. 2nd International Workshop on Strategic Reasoning, Apr 2014, 2014-04-06, France. pp.11, ⟨10.4204/EPTCS.146.13⟩. ⟨hal-01098740⟩
238 View
133 Download



Gmail Facebook X LinkedIn More