Affiliation:
1. Univ Rennes, CNRS, IRISA, 35042 Rennes Cedex, France
Abstract
Abstract
We study the symbolic model checking problem against public announcement protocol logic (PAPL), featuring protocols with public announcements, arbitrary public announcements and group announcements. Technically, symbolic models are Kripke models whose accessibility relations are presented as programs described in a dynamic logic style with propositional assignments. We highlight the relevance of such symbolic models and show that the symbolic model checking problem against PAPL is A$_{\textrm{pol}}$Exptime-complete as soon as announcement protocols allow for either arbitrary announcements or iteration of public announcements. However, when both options are discarded, the complexity drops to Pspace-complete.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference43 articles.
1. Group announcement logic;Agotnes;Journal of Applied Logics,2010
2. Boolean games with epistemic goals;Agotnes,2013
3. The undecidability of group announcements;Agotnes,2014
4. Binary decision diagrams;Akers;IEEE Transactions on Computers,1978
5. Alternating-time temporal logic;Alur;Journal of the ACM,2002
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献