Soundness of workflow nets: classification, decidability, and analysis (Q539433)
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: Soundness of workflow nets: classification, decidability, and analysis |
scientific article; zbMATH DE number 5900838
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Soundness of workflow nets: classification, decidability, and analysis |
scientific article; zbMATH DE number 5900838 |
Statements
Soundness of workflow nets: classification, decidability, and analysis (English)
0 references
30 May 2011
0 references
The workflow verification is an object of investigation since a few years. The WorkFlow Nets (WFNs) were introduced by the first author, W. M. P. van der Aalst, in 1997 as a particular case of Petri nets. In the following research of the same author it was shown that WFNs can be used as a tool for modelling and analysis of workflows. In the present research, important properties of WFNs, related to decidability and undecidability problems, are studied.
0 references
Petri nets
0 references
decidability
0 references
workflow nets
0 references
reset nets
0 references
soundness
0 references
verification
0 references
0.9502983
0 references
0.9427459
0 references
0.93991214
0 references
0 references
0.93252736
0 references
0.9278163
0 references
0.9254973
0 references
0.92448586
0 references
