Determining best-case and worst-case times of unknown paths in time workflow nets (Q632513)
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: Determining best-case and worst-case times of unknown paths in time workflow nets |
scientific article; zbMATH DE number 5870372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining best-case and worst-case times of unknown paths in time workflow nets |
scientific article; zbMATH DE number 5870372 |
Statements
Determining best-case and worst-case times of unknown paths in time workflow nets (English)
0 references
25 March 2011
0 references
time workflow nets
0 references
control flow
0 references
0.7776208519935608
0 references
0.7123145461082458
0 references
0.6964209675788879
0 references
