We define a game on distributed Petri nets, where several players interact with each other, and with an environment. The players, or users, have perfect knowledge of the current state, and pursue a common goal. Such goal is expressed by Alternating-time Temporal Logic (ATL). The users have a winning strategy if they can cooperate to reach their goal, no matter how the environment behaves. We show that such a game can be translated into a game on concurrent game structures (introduced in order to give a semantics to ATL). We compare our game with the game on concurrent game structures and discuss the differences between the two approaches. Finally, we show that, when we consider memoryless strategies and a fragment of ATL, we can construct a concurrent game structure from the Petri net, such that an ATL formula is verified on the net if, and only if, it is verified on the game structure.

中文翻译：

---

Petri 网和 ATL 上的异步博弈

我们在分布式 Petri 网上定义了一个游戏，其中多个玩家相互交互，并与环境交互。玩家或用户对当前状态有完美的了解，并追求共同的目标。这样的目标由交替时间时间逻辑 (ATL) 表示。如果用户能够合作以实现他们的目标，无论环境如何表现，他们就有一个制胜策略。我们展示了这样的游戏可以被翻译成并发游戏结构的游戏（引入是为了给 ATL 一个语义）。我们将我们的游戏与并发游戏结构上的游戏进行比较，并讨论两种方法之间的差异。最后，我们表明，当我们考虑无记忆策略和 ATL 片段时，我们可以从 Petri 网构建并发博弈结构，这样 ATL 公式在网络上得到验证，如果，