History-based joins: Semantics, soundness and implementation

  • Authors:
  • Kees van Hee;Olivia Oanea;Alexander Serebrenik;Natalia Sidorova;Marc Voorhoeve

  • Affiliations:
  • Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study the use of case history for control structures in workflow processes. History-dependent control offers much more modeling power than classical control structures and it solves several semantical problems of industrial modeling frameworks. In particular, we introduce a history-dependent join. We study the modeling power by means of workflow patterns. Since proper completion (i.e. the ability of any configuration reachable from the initial one to reach the final one) is always an important ''sanity check'' of process modeling, we introduce a modeling method that guarantees this property holds. Finally we consider an implementation of the proposed control structures on top of an existing workflow engine.