Stubborn Versus Structural Reductions for Petri Nets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113644" target="_blank" >RIV/00216224:14330/19:00113644 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.jlamp.2018.09.002" target="_blank" >https://doi.org/10.1016/j.jlamp.2018.09.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jlamp.2018.09.002" target="_blank" >10.1016/j.jlamp.2018.09.002</a>
Alternative languages
Result language
angličtina
Original language name
Stubborn Versus Structural Reductions for Petri Nets
Original language description
Partial order and structural reduction techniques are some of the most beneficial methods for state space reduction in reachability analysis of Petri nets. This is among others documented by the fact that these techniques are used by the leading tools in the annual Model Checking Contest (MCC) of Petri net tools. We suggest improved versions of a partial order reduction based on stubborn sets and of a structural reduction with additional new reduction rules, and we extend both methods for the application on Petri nets with weighted arcs and weighted inhibitor arcs. All algorithms are implemented in the open-source verification tool TAPAAL and evaluated on a large benchmark of Petri net models from MCC'17, including a comparison with the tool LoLA (the last year winner of the competition). The experiments document that both methods provide significant state space reductions and, even more importantly, that their combination is indeed beneficial as a further nontrivial state space reduction can be achieved.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Logical and Algebraic Methods in Programming
ISSN
2352-2208
e-ISSN
2352-2216
Volume of the periodical
102
Issue of the periodical within the volume
January 2019
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
18
Pages from-to
46-63
UT code for WoS article
000453499800003
EID of the result in the Scopus database
2-s2.0-85064897283