Structural reductions are a powerful class of techniques that reason on a specification with the goal to reduce it before attempting to explore its behaviors. In this paper we present new structural reduction rules for verification of deadlock freedom and safety properties of Petri nets. These new rules are presented together with a large body of rules found in diverse literature. For some rules we leverage an SMT solver to compute if application conditions are met. We use a CEGAR approach based on progressively refining the classical state equation with new constraints, and memory-less exploration to confirm counterexamples. Extensive experimentation demonstrates the usefulness of this structural verification approach.

中文翻译：

---

重新审视结构性削减

结构化约简是一​​类强大的技术，它对规范进行推理，目的是在尝试探索其行为之前减少它。在本文中，我们提出了新的结构约简规则，用于验证 Petri 网的死锁自由度和安全性。这些新规则与各种文献中的大量规则一起呈现。对于某些规则，我们利用 SMT 求解器来计算是否满足应用条件。我们使用 CEGAR 方法，该方法基于逐步改进具有新约束的经典状态方程和无记忆探索以确认反例。大量实验证明了这种结构验证方法的有用性。