Petri Nets are a widely used formalism to deal with concurrent systems. Dynamic Logics (DLs) are a family of modal logics where each modality corresponds to a program. Petri-PDL is a logical language that combines these two approaches: it is a dynamic logic where programs are replaced by Petri Nets. In this work we present a clausal resolution-based calculus for Petri-PDL. Given a Petri-PDL formula, we show how to obtain its translation into a normal form to which a set of resolution-based inference rules are applied. We show that the resulting calculus is sound, complete, and terminating. Some examples of the application of the method are also given.

中文翻译：

---

Petri 网推理：基于分辨率和动态逻辑的微积分

Petri 网是一种广泛使用的处理并发系统的形式。动态逻辑 (DL) 是一系列模态逻辑，其中每个模态对应于一个程序。Petri-PDL 是一种结合了这两种方法的逻辑语言：它是一种动态逻辑，其中程序被 Petri 网取代。在这项工作中，我们提出了一种基于分句解析的 Petri-PDL 微积分。给定一个 Petri-PDL 公式，我们将展示如何将其转换为应用一组基于分辨率的推理规则的范式。我们证明了得到的演算是健全的、完整的和终止的。还给出了该方法的一些应用实例。