Computing History-Dependent Schedules for Processes with Temporal Constraints

Abstract

The importance of adequate management of temporal aspects of process aware information systems is beyond dispute. A particular problem for the management of temporal constraints is to check whether a process definition is correct, where correctness is defined by history-dependent controllability. This means to check whether a history-dependent schedule exists, which obeys all temporal constraints. A schedule defines temporal execution intervals for process steps, in a history-dependent schedule a step might have several execution intervals depending on the control decisions made before this process step is activated. We present a procedure for checking the history-dependent controllability of processes with temporal constraints which is both sound and complete and effectively computes history-dependent schedules for temporally constrained business processes.