Minimal coverability tree construction made complete and efficient (Q2200824)
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 tree construction made complete and efficient |
scientific article; zbMATH DE number 7250941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal coverability tree construction made complete and efficient |
scientific article; zbMATH DE number 7250941 |
Statements
Minimal coverability tree construction made complete and efficient (English)
0 references
23 September 2020
0 references
Petri nets
0 references
Karp-Miller tree algorithm
0 references
coverability
0 references
minimal coverability set
0 references
clover
0 references
minimal coverability tree
0 references
0.8875254392623901
0 references
0.8821731209754944
0 references
0.8430177569389343
0 references
0.8427473902702332
0 references
0.8415965437889099
0 references