Paper Info
Title
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach.
Abstract
This work extends our previous work [4], [22] with the iteration operator. This new operator allows for representing more general networks and thus enhancing the former propositional logic for Petri nets. We provide an axiomatization and a new semantics, prove soundness and completeness with respect to its semantics and the EXPTIME-Hardness of its satisfiability problem, present a linear model checking algorithm and show that its satisfiability problem is in 2EXPTIME. In order to illustrate its usage, we also provide some examples.
Year
DOI
Venue
2018
10.1016/j.tcs.2018.01.007
Theoretical Computer Science
Keywords
Field
DocType
Dynamic Logic,Petri nets,Modal Logic
Discrete mathematics,Petri net,Boolean satisfiability problem,Propositional calculus,Theoretical computer science,Operator (computer programming),Soundness,Dynamic logic (digital electronics),Completeness (statistics),Semantics,Mathematics
Journal
Volume
ISSN
Citations 
744
0304-3975
0
PageRank 
References 
Authors
0.34
15
3
Name
Order
Citations
PageRank
Mario R. F. Benevides1111.96
Bruno Lopes2144.40
Edward Hermann Haeusler310233.20