ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS

Roman Barták

Abstract

Workflow is a formal description of a process or processes. There exist tools for interactive and visual editing of workflows such as the FlowOpt Workflow Editor. During manual editing of workflows, it is common to introduce flaws such as cycles of activities. Hence one of the required features of workflow management tools is verification of workflows, which is a problem of deciding whether the workflow describes processes that can be realized in practice. In this paper we deal with the theoretical complexity of verifying workflows with a nested structure and with extra constraints. The nested structure forces users to create valid workflows but as we shall show, introduction of extra causal, precedence, and temporal synchronization constraints makes the problem of deciding whether the workflow represents a realizable process hard. In particular, we will show that this problem is NP-complete.

References

  1. Bae, J., Bae, H., Kang, S.-H., Kim, Z., 2004. Automatic Control of Workflow Processes Using ECA Rules. IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 8, pp. 1010-1023.
  2. Barták, R., Cepek, O., 2007. Temporal Networks with Alternatives: Complexity and Model. In Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS), AAAI Press, pp. 641-646.
  3. Barták, R., Cepek, O., 2008. Nested Temporal Networks with Alternatives: Recognition, Tractability, and Models. In Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 2008), LNAI 5253, Springer Verlag, pp. 235-246.
  4. Barták, R., Cepek, O., Hejna, M., 2008. Temporal Reasoning in Nested Temporal Networks with Alternatives. In Recent Advances in Constraints, LNAI 5129, Springer Verlag, pp. 17-31.
  5. Barták, R., Cully, M., Jaška, M., Novák, L., Rovenský, V., Sheahan, C., Skalický, T., Thanh-Tung, D., 2011. FlowOpt: A Set of Tools for Modeling, Optimizing, Analyzing, and Visualizing Production Workflows. In Proceedings of the ICAPS 2011 System Demonstrations, pp. 6-9.
  6. Beck, J. Ch., Fox, M. S., 2000. Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence, vol. 121, pp. 211-250.
  7. Bi, H. H., Zhao, J. L., 2004. Applying Propositional Logic to Workflow Verification. Information Technology and Management, vol. 5, no 3-4, pp. 293-318.
  8. Garey, M. R., Johnson, D. S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company.
  9. Giro, S., 2007. Workflow Verification: A New Tower of Babel. In AIS-CMS International Modeling and Simulation Multiconference, Buenos Aires, Argentina.
  10. Sadiq, W., Orlowska, M. E., 2000. Analyzing Process Models using Graph Reduction Techniques. Information Systems, vol. 25, no. 2, pp. 117-134.
  11. van der Aalst, W., Hofstede, A. H. M. t., 2000. Verification of Workflow Task Structures: A PetriNet-Based Approach. Information Systems, vol. 25, no. 1, pp. 43-69.
  12. van der Aalst, W., Hofstede, A. H. M. t., 2005. Yawl: Yet another workflow langure. Information Systems, vol. 30, no. 4, pp. 245-275.
Download


Paper Citation


in Harvard Style

Barták R. (2012). ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 346-354. DOI: 10.5220/0003748003460354


in Bibtex Style

@conference{icaart12,
author={Roman Barták},
title={ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={346-354},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003748003460354},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS
SN - 978-989-8425-95-9
AU - Barták R.
PY - 2012
SP - 346
EP - 354
DO - 10.5220/0003748003460354