Stubborn versus structural reductions for Petri nets

Journal of Logical and Algebraic Methods in Programming(2019)

Cited 15|Views14
No score
Abstract
•Stubborn reductions are extendable to Petri nets with weighted inhibitor arcs.•Structural reduction rules refined for weighted arcs to increase applicability.•Combination of reduction techniques does not overlap.•TAPAAL surpassing LoLA on answering reachability queries.
More
Translated text
Key words
Partial order reduction,Stubborn sets,Structural reductions,Reachability analysis,Petri nets
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined