Faster verification of partially ordered runs in Petri nets using compact tokenflows (Q5300880)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6182484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster verification of partially ordered runs in Petri nets using compact tokenflows |
scientific article; zbMATH DE number 6182484 |
Statements
Faster Verification of Partially Ordered Runs in Petri Nets Using Compact Tokenflows (English)
0 references
28 June 2013
0 references
0.8955003619194031
0 references
0.8716455698013306
0 references
0.8037825226783752
0 references
0.7922567129135132
0 references
0.7760885953903198
0 references
