arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0790cs.LOcs.GT
收藏

不完全信息下的有耗渠道博弈

Lossy Channel Games under Incomplete Information

Rayna Dimitrova, Bernd Finkbeiner

摘要:

在本文中,我们研究不完全信息下的有损通道游戏,其中两个球员操作的有限的一组无界FIFO通道和一个球员,代表一个系统组件的考虑下不完全信息下操作,而另一个球员,代表组件的环境被允许从通道丢失消息。我们认为,这些游戏是一个合适的模型,用于合成的通信协议,其中进程通过不可靠的通道进行通信。我们表明,在有限的消息字母表的情况下,游戏的安全性和可达性获胜的条件是可判定的和有限状态的观察为基础的战略组件可以有效地计算。(弱)奇偶目标的不可判定性来自(弱)奇偶完全信息博弈的不可判定性,其中只有一个参与者可以丢失消息。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑