The manual implementation of local controllers for autonomous agents in a distributed and concurrent setting is an ambitious and error-prune task. Synthesis algorithms, however, allow for the automatic generation of such controllers given a formal specification of the system’s goal. Recently, high-level Petri games were introduced to allow for a concise modeling technique of distributed systems with a safety objective. One way of solving these games is by a translation to low-level Petri games and applying an existing solving algorithm. In this paper we present a new solving technique for a subclass of high-level Petri games with a single uncontrollable player, a bounded number of controllable players, and a local safety objective. The technique exploits symmetries in the high-level Petri game. We report on encouraging experimental results of a prototype implementation generating the reduced state space. The results for four existing and one new benchmark family show a state space reduction by up to three orders of magnitude.

中文翻译：

---

解决高级 Petri 游戏

在分布式和并发环境中手动实现自治代理的本地控制器是一项雄心勃勃的错误修剪任务。然而，综合算法允许在给定系统目标的正式规范的情况下自动生成此类控制器。最近，引入了高级 Petri 游戏，以实现具有安全目标的分布式系统的简洁建模技术。解决这些游戏的一种方法是转换为低级 Petri 游戏并应用现有的求解算法。在本文中，我们为具有单个不可控玩家、有限数量可控玩家和局部安全目标的高级 Petri 游戏的子类提出了一种新的求解技术。该技术利用了高级 Petri 游戏中的对称性。我们报告了生成减少状态空间的原型实现的令人鼓舞的实验结果。四个现有基准系列和一个新基准系列的结果显示状态空间减少了三个数量级。