Back to Search
Start Over
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach.
- Source :
-
Theoretical Computer Science . Oct2018, Vol. 744, p22-36. 15p. - Publication Year :
- 2018
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 744
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 131729855
- Full Text :
- https://doi.org/10.1016/j.tcs.2018.01.007