论文标题
在Petri网上的两人游戏中寻找赢得策略，并具有部分可观察性
Looking for winning strategies in two-player games on Petri nets with partial observability
论文作者
论文摘要
我们定义了1-Safe Petri网的游戏，用户可以在环境上玩耍以达到系统的目标。该目标通过LTL-X公式表示，代表用户需要保证的系统的行为。用户可以通过控制过渡的子集以及观察当地状态的子集来实现他的目标。尽管我们没有对用户观察到的当地状态提出任何要求，但我们假设他不能确定在确切的时刻观察它们。因此，我们定义了观察的稳定性概念。我们提出了一种方法来确定用户是否具有获胜策略，即他是否可以根据可用的信息来做出一些决定来赢得每场比赛。
We define a game on 1-safe Petri nets, where a user plays against an environment in order to reach a goal on the system. The goal is expressed through an LTL-X formula, and represents a behaviour of the system that the user needs to guarantee. The user can try to reach his goal by controlling a subset of transitions, and by observing a subset of local states. Although we do not put any requirement on the local states observable by the user, we assume that he cannot be sure to observe them in the exact moment in which they become marked. For this reason, we define a notion of stability of the observation. We propose a method to determine whether the user has a winning strategy, i.e. if he can win every play by taking some decisions based on the information available for him.
