Adaptive process–aware information systems must be able to support ad–hoc changes of single process instances as well as schema modifications at the process type level and their propagation to a collection of related process instances. So far these two kinds of (dynamic) process changes have been mainly considered in an isolated fashion. Especially for long-running processes, however, it must be possible to adequately handle the interplay between type and instance changes as well. One challenge in this context is to determine whether concurrent process type and process instance changes have the same or overlapping effects on the original process schema or not. Information about the degree of overlap is needed, for example, to determine whether and – if yes – how a process type change can be propagated to individually modified process instances as well. This paper provides a formal framework for dealing with overlapping and disjoint process changes and presents adequate migration strategies depending on the particular degree of overlap. In order to obtain a canonical representation of changes an algorithm is introduced which purges change logs from noisy information. Finally, a powerful proof-of-concept prototype exists.
|Number of pages||20|
|Publication status||Published - Oct 2004|
|Event||12th International Conference on Cooperative Information Systems, CoopIS 2004 - Agia Napa, Cyprus|
Duration: 25 Oct 2004 → 29 Oct 2004
Conference number: 12
|Conference||12th International Conference on Cooperative Information Systems, CoopIS 2004|
|Period||25/10/04 → 29/10/04|