Content Management Systems in the field of content production and publishing need to monitor the progress of large numbers of simultaneously evolving workflows. In order to make such systems adaptive to the varying needs of their organizations, the utilization of a graphical editor for workflows has been proposed, thus generating the hazard of the specification of erroneous and invalid workflows. In this paper we provide a formal modeling for workflows and then, based on it, we explain how the validity of a simple workflow can be evaluated through the examination of the transitive closure of its graph. Continuing to the more general case, we develop a problem transformation methodology that allows for all workflows to be validated using a transitive closure examination approach. The Python implementation of our methodology is provided as is freely to all interested parties.


Transitive Closure Content Management System Graphic Artist Dummy Node Multiple Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    A. P. Barros, A. H. M. ter Hofstede, Towards the construction of workflow-suitable conceptual modelling techniques, Information Systems Journal 8(4), 313–337, 1998.CrossRefGoogle Scholar
  2. 2.
    W. M. P. van der Aalst, A. H. M. ter Hofstede, B. Kiepuszewski and A. P. Barros, Workflow Patterns, Distributed and Parallel Databases 14(1), pp. 5–51, 2004.CrossRefGoogle Scholar
  3. 3.
    W. M. P. van der Aalst, M. Weske, G. Wirtz, Advanced topics in workflow management: issues, requirements, and solutions, Journal of Integrated Design and Process Science 7(3), 2003.Google Scholar
  4. 4.
    M. M. Compton, S. Wolfe, Intelligent validation and routing of electronic forms in adistributed workflow environment, Proceedings of the Tenth Conference on Artificial Intelligence for Applications, 1994.Google Scholar
  5. 5.
    S. Sadiq, M. Orlowska, W. Sadiq, C. Foulger, Data flow and validation in workflow modeling, Proceedings of the 15th Australasian database conference, 2004.Google Scholar
  6. 6.
    M. Wallace, S. Kollias, Two Algorithms For Fast Incremental Transitive Closure Of Sparse Fuzzy Binary Relations, International Journal of Computational Methods, in press.Google Scholar
  7. 7.
    M. Wallace, Y. Avrithis, S. Kollias, Computationally efficient sup-t transitive closure for sparse fuzzy binary relations, Fuzzy Sets and Systems 157(3), pp. 341–372, 2006.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© International Federation for Information Processing 2007

Authors and Affiliations

  • Anastasios Giouris
    • 1
  • Manolis Wallace
    • 1
  1. 1.Department of Computer ScienceUniversity of Indianapolis AthensSyntagmaGreece

Personalised recommendations