Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning (Q4914290)
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: Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning |
scientific article; zbMATH DE number 6155482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning |
scientific article; zbMATH DE number 6155482 |
Statements
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (English)
0 references
18 April 2013
0 references
Petri nets
0 references
concurrent systems
0 references
verification
0 references
0.9968279004096984
0 references
0.8654839396476746
0 references
0.8623080849647522
0 references
0.8601868152618408
0 references
0.8556127548217773
0 references
