scholarly journals A Calculus for Automatic Verification of Petri Nets Based on Resolution and Dynamic Logics

2015 ◽  
Vol 312 ◽  
pp. 125-141 ◽  
Author(s):  
Cláudia Nalon ◽  
Bruno Lopes ◽  
Gilles Dowek ◽  
Edward Hermann Haeusler
Keyword(s):  
Petri Nets ◽  
Automatic Verification ◽  
Dynamic Logics

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

2021 ◽  
Vol 22 (2) ◽  
pp. 1-22
Author(s):  
Bruno Lopes ◽  
Cláudia Nalon ◽  
Edward Hermann Haeusler
Keyword(s):  
Normal Form ◽  
Petri Nets ◽  
Dynamic Logic ◽  
Concurrent Systems ◽  
Modal Logics ◽  
Inference Rules ◽  
Logical Language ◽  
Dynamic Logics

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.

Modeling and Analyzing Component-Based Distributed Railway Interlocking System with Petri Nets

2009 ◽  
Vol 129 (5) ◽  
pp. 455-461 ◽  
Author(s):  
Xinhong Hei ◽  
Sei Takahashi ◽  
Hideo Nakamura
Keyword(s):  
Petri Nets
Sign in / Sign up

Export Citation Format

Share Document