Ceong Hee Taek, Lee Do Heon, Kim Moon Ja, Lew Young Chul

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 2, pp. 261-273, Feb. 1999
10.3745/KIPSTE.1999.6.2.261,   PDF Download:

Abstract

Recently, automated business processing systems, so called workflow systems, have been studied. Even though each task has noticible duration inherently, most of previous models regard it as a simple finite automaton where state transitons occur instantly. In this paper, we propose a modeling method for workflows each of whose component task has minimum processing time and due-date. Firstly, we provide a priority function to choose the propoer alternatives when tasks fail before their due-date. The priority function considers the time-relevant factor and the semantic compatibility level to decide the best alternative. Secondly, we identify six different types of execution requirements for tasks with noticible durations. They are serial, parallel, simultaneous start, simultaneous termination, interleaved and nested dependency. Note that previous models deal with only serial execution and parallel execution. Lastly, we also propose graph-based methods to detect logical conflicts in time constraint-based workflow specifications.

Statistics
Cite this article