Lightweight query-based analysis of workflow process dependencies

  • Authors:

  • W. Dai;D. Covvey;P. Alencar;D. Cowan

  • Affiliations:

  • University of Waterloo, David R. Cheriton School of Computer Science, Waterloo, Ontario, Canada N2L3G1;University of Waterloo, Department of Biology, School of Optometry, Waterloo, Ontario, Canada N2L3G1;University of Waterloo, David R. Cheriton School of Computer Science, Waterloo, Ontario, Canada N2L3G1;University of Waterloo, David R. Cheriton School of Computer Science, Waterloo, Ontario, Canada N2L3G1

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dependency analysis is important in all of the stages of workflow processes. Workflow elements and features are always difficult to track and as their changes often lead to code tangling as a result of the addition of new requirements and programs. This mosaic quality complicates program comprehension and maintenance. Therefore, an appropriate analysis will help us to identify the potentially affected entities if changes occur. In this paper we present an approach for the lightweight analysis of workflow process dependencies, which include routing, data and roles dependencies. The model is represented as a knowledge base using a logic programming language, Prolog. We develop a set of query rules that can be applied to the well-defined knowledge base at both activity and process levels to retrieve the potentially affected entities. Finally, we use a case study of workflow processes in the healthcare domain to show how our dependency analysis approach works.