New symbolic algorithms compute a single parameterized reachability graph for Petri net product lines that captures all product behaviors without enumeration.
In: Dang, T., Stolz, V
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Construction of Reachability Graphs for Petri Net Product Lines
New symbolic algorithms compute a single parameterized reachability graph for Petri net product lines that captures all product behaviors without enumeration.