Asynchronous announcements in a public channel

Sophia Knight, Bastien Maubert, François Schwarzentruber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


We propose a variant of public announcement logic for asynchronous systems. We give a syntax where sending and receiving messages are modeled by different modal operators. The natural approach to defining the semantics leads to a circular definition, but we describe two restricted cases in which we solve this problem. The first case requires the Kripke model representing the initial epistemic situation to be a finite tree, and the second one only allows announcements from the existential fragment. Finally, we provide complexity results for the model checking problem.

Original languageEnglish (US)
Title of host publicationTheoretical Aspects of Computing – ICTAC 2015 - 12th International Colloquium, Proceedings
EditorsCamilo Rueda, Frank D. Valencia, Frank D. Valencia, Martin Leucker
PublisherSpringer Verlag
Number of pages18
ISBN (Print)9783319251493
StatePublished - 2015
Externally publishedYes
Event12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015 - Cali, Colombia
Duration: Oct 29 2015Oct 31 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015

Bibliographical note

Funding Information:
We thank Hans van Ditmarsch for invaluable discussion and support of this work. We acknowledge support from ERC project EPS 313360.

Publisher Copyright:
© Springer International Publishing Switzerland 2015.


Dive into the research topics of 'Asynchronous announcements in a public channel'. Together they form a unique fingerprint.

Cite this