论文信息 - Simplifying Verification of Nested Workflows with Extra Constraints

Simplifying Verification of Nested Workflows with Extra Constraints

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 NPcomplete 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.

Roman Barták

[1] Roman Barták,et al. Verifying Nested Workflows with Extra Constraints , 2012, MICAI.

[2] Wil M. P. van der Aalst,et al. Verification Of Workflow Task Structures: A Petri-net-baset Approach , 2000, Inf. Syst..

[3] Roman Bart´k,et al. Workflow Optimization with FlowOpt: On Modelling, Optimizing, Visualizing, and Analysing Production Workflows , 2011, 2011 International Conference on Technologies and Applications of Artificial Intelligence.

[4] R. Barták. Nested Temporal Networks with Alternatives , 2007 .

[5] Roman Barták,et al. Nested temporal networks with alternatives: recognition and tractability , 2008, SAC '08.

[6] Moe Thandar Wynn,et al. Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[7] Roman Barták,et al. On Complexity of Verifying Nested Workflows with Extra Constraints , 2018, ICAART.

[8] Hyerim Bae,et al. Automatic control of workflow processes using ECA rules , 2004, IEEE Transactions on Knowledge and Data Engineering.

[9] Mark Abramson,et al. Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[10] Sergio Giro. Workflow Verification : a New Tower of Babel , 2007 .