Publication at Faculty of Mathematics and Physics |
2013
Abstract
Workflow verification is an important aspect of workflow modeling where the verification task is to ensure that the workflow describes feasible processes. It has been shown that verifying nested workflows with extra precedence, causal, and temporal synchronization constraints is an NP-complete problem and a verification method based on constraint satisfaction has been proposed.
This paper theoretically justifies the task-collapsing component of this method and provides examples of easy-to-verify constraints.