A lazy query scheme for reachability analysis in Petri nets (Q2117184)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lazy query scheme for reachability analysis in Petri nets |
scientific article; zbMATH DE number 7493585
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lazy query scheme for reachability analysis in Petri nets |
scientific article; zbMATH DE number 7493585 |
Statements
A lazy query scheme for reachability analysis in Petri nets (English)
0 references
21 March 2022
0 references
reachability analysis
0 references
unbounded Petri nets
0 references
inhibitor arcs
0 references
lazy algorithms
0 references
0.8763525
0 references
0.8762205
0 references
0.8750626
0 references
0.87228477
0 references
0 references
0.8704593
0 references
0.8659918
0 references
