Lossy Channel Games under Incomplete Information

Rayna Dimitrova
(Saarland University, Germany)
Bernd Finkbeiner
(Saarland University, Germany)

In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under incomplete information, while the other player, representing the component's environment is allowed to lose messages from the channels. We argue that these games are a suitable model for synthesis of communication protocols where processes communicate over unreliable channels. We show that in the case of finite message alphabets, games with safety and reachability winning conditions are decidable and finite-state observation-based strategies for the component can be effectively computed. Undecidability for (weak) parity objectives follows from the undecidability of (weak) parity perfect information games where only one player can lose messages.

In Fabio Mogavero, Aniello Murano and Moshe Y. Vardi: Proceedings 1st International Workshop on Strategic Reasoning (SR 2013), Rome, Italy, March 16-17, 2013, Electronic Proceedings in Theoretical Computer Science 112, pp. 43–51.
Published: 1st March 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.112.9 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org