Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jlamp.2018.09.002 | Journal of Logical and Algebraic Methods in Programming |
Keywords | Field | DocType |
Partial order reduction,Stubborn sets,Structural reductions,Reachability analysis,Petri nets | Model checking,Petri net,Inhibitor arcs,Theoretical computer science,Reachability,State space reduction,Partial order reduction,State space,Mathematics | Journal |
Volume | Issue | ISSN |
102 | 1 | 2352-2208 |
Citations | PageRank | References |
1 | 0.36 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederik M. Bønneland | 1 | 1 | 0.36 |
| Jakob Dyhr | 2 | 1 | 0.36 |
| Peter Gjøl Jensen | 3 | 32 | 9.38 |
| Mads Johannsen | 4 | 1 | 0.36 |
| Jirí Srba | 5 | 252 | 28.68 |