Merging business process models
Data(s) |
2010
|
---|---|
Resumo |
This paper addresses the following problem: given two or more business process models, create a process model that is the union of the process models given as input. In other words, the behavior of the produced process model should encompass that of the input models. The paper describes an algorithm that produces a single configurable process model from an arbitrary collection of process models. The algorithm works by extracting the common parts of the input process models, creating a single copy of them, and appending the differences as branches of configurable connectors. This way, the merged process model is kept as small as possible, while still capturing all the behavior of the input models. Moreover, analysts are able to trace back from which original model(s) does a given element in the merged model come from. The algorithm has been prototyped and tested against process models taken from several application domains. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer-Verlag Heidelberg |
Relação |
http://eprints.qut.edu.au/29120/2/29120.pdf DOI:10.1007/978-3-642-16934-2_10 La Rosa, Marcello, Dumas, Marlon, Kaarik, Reina, & Dijkman, Remco M. (2010) Merging business process models. In Lecture Notes in Computer Science: On the Move to Meaningful Internet Systems, Springer-Verlag Heidelberg, Crete, Greece, pp. 96-113. |
Direitos |
Copyright 2010 Springer-Verlag Heidelberg This is the author-version of the work. The original publication is available at SpringerLink: http://www.springer.de/comp/lncs/ |
Fonte |
Faculty of Science and Technology |
Palavras-Chave | #080699 Information Systems not elsewhere classified #process model #merge #configuration |
Tipo |
Conference Paper |