On the Completeness of Logic-Based Workflow Verification

6 Pages Posted: 1 Mar 2010 Last revised: 28 Apr 2019

See all articles by J. Leon Zhao

J. Leon Zhao

City University of Hong Kong (CityUHK)

Henry H. Bi

Willamette University - Atkinson Graduate School of Management

Date Written: 2003

Abstract

The increasing complexity of business processes makes workflow design a challenging task. However, most of commercial workflow management systems do not provide workflow designers with workflow verification tools. We propose a logic-based verification approach that is based on propositional logic as an alternative to existing workflow verification methods. We have shown previously that logic-based workflow verification can verify the correctness of both acyclic and cyclic workflow graphs that do not contain overlapping patterns. In this paper, we extend our previous work to handle overlapping patterns by proposing the idea of instance-based logic formulas and prove its completeness in detecting structural anomalies in acyclic workflow graphs.

Keywords: workflow, verification

JEL Classification: M1

Suggested Citation

Zhao, J. Leon and Bi, Henry H., On the Completeness of Logic-Based Workflow Verification (2003). J. Leon Zhao, Henry H. Bi. 2003. On the completeness of logic-based workflow verification. Proceedings of the Thirteenth Workshop on Information Technologies and Systems (WITS 2003), Seattle, WA, USA, December 13-14, 2003. pp. 73-78. DOI: 10.13140/RG.2.1.4018.9285, Available at SSRN: https://ssrn.com/abstract=1561316

J. Leon Zhao

City University of Hong Kong (CityUHK)

83 Tat Chee Avenue
Kowloon
Hong Kong

Henry H. Bi (Contact Author)

Willamette University - Atkinson Graduate School of Management ( email )

900 State Street
Salem, OR 97301
United States

HOME PAGE: http://willamette.edu/mba/faculty-research/faculty/bi/index.html

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
28
Abstract Views
506
PlumX Metrics