Abstract
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 language | English (US) |
|---|---|
| Title of host publication | Theoretical Aspects of Computing – ICTAC 2015 - 12th International Colloquium, Proceedings |
| Editors | Camilo Rueda, Frank D. Valencia, Frank D. Valencia, Martin Leucker |
| Publisher | Springer Verlag |
| Pages | 272-289 |
| Number of pages | 18 |
| ISBN (Print) | 9783319251493 |
| DOIs | |
| State | Published - 2015 |
| Externally published | Yes |
| Event | 12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015 - Cali, Colombia Duration: Oct 29 2015 → Oct 31 2015 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9399 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 12th International Colloquium on Theoretical Aspects of Computing, ICTAC 2015 |
|---|---|
| Country/Territory | Colombia |
| City | Cali |
| Period | 10/29/15 → 10/31/15 |
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.