Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic-Reference-Cited by-同舟云学术

Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic

Published:2021-05-15 Issue:2 Volume:22 Page:1-22
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Lopes Bruno¹^ORCID,Nalon Cláudia²^ORCID,Haeusler Edward Hermann³

Affiliation:

1. Universidade Federal Fluminense, Brazil

2. Universidade de Brasília, Brazil

3. Pontifícia Universidade Católica do Rio de Janeiro, Brazil

Abstract

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.

Funder

CNPq

CAPES

FAPERJ

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3441655

Reference33 articles.

1. Proving properties in ordinary Petri Nets using LoRes logical language;de Almeida Eliana S.;Petri Net Newsletter,1999

2. Sequential and distributed model checking of Petri;Bell Alexander;Nets. Int. J. Softw. Tools Technol. Transf.,2005

3. Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach