Verification problems in conceptual workflow specifications

• Published in: Data & knowledge engineering 1998, Vol.24 (3), p.239-256
• Main Authors: ter Hofstede, A.H.M, Orlowska, M.E, Rajapakse, J
• Format: Article
• Language: English
• Subjects: Computational complexity; Verification; Workflow
• ISSN: 0169-023X; 1872-6933
• DOI: 10.1016/S0169-023X(97)00032-3

Most of today's business requirements can only be accomplished through integration of various autonomous systems which were initially designed to serve the needs of particular applications. In the literature workflows are proposed to design these kinds of applications. The key tool for designing such applications is a powerful conceptual specification language. Such a language should be capable of capturing interactions and cooperation between component tasks of workflows among others. These include sequential execution, iteration, choice, parallelism and synchronisation. The central focus of this paper is the verification of such process control aspects in conceptual workflow specifications. As is generally agreed upon, that the later in the software development process an error is detected, the more it will cost to correct it; it is thus of vital importance to detect errors as early as possible in the systems-development process. In this paper some typical verification problems in workflow specifications are identified and their complexity is addressed. It will be proven that some fundamental problems are not tractable and we will show what restriction is needed to allow termination problems to be recognized in polynomial time.