TY  - JOUR
A1  - Weidlich, Matthias
A1  - Dijkman, Remco
A1  - Weske, Mathias
T1  - Behaviour equivalence and compatibility of business process models with complex correspondences
JF  - The computer journal : a publication of the British Computer Society
N2  - Once multiple models of a business process are created for different purposes or to capture different variants, verification of behaviour equivalence or compatibility is needed. Equivalence verification ensures that two business process models specify the same behaviour. Since different process models are likely to differ with respect to their assumed level of abstraction and the actions that they take into account, equivalence notions have to cope with correspondences between sets of actions and actions that exist in one process but not in the other. In this paper, we present notions of equivalence and compatibility that can handle these problems. In essence, we present a notion of equivalence that works on correspondences between sets of actions rather than single actions. We then integrate our equivalence notion with work on behaviour inheritance that copes with actions that exist in one process but not in the other, leading to notions of behaviour compatibility. Compatibility notions verify that two models have the same behaviour with respect to the actions that they have in common. As such, our contribution is a collection of behaviour equivalence and compatibility notions that are applicable in more general settings than existing ones.
KW  - behaviour equivalence
KW  - behaviour compatibility
KW  - model verification
KW  - behavioural models
Y1  - 2012
U6  - https://doi.org/10.1093/comjnl/bxs014
SN  - 0010-4620
SN  - 1460-2067
VL  - 55
IS  - 11
SP  - 1398
EP  - 1418
PB  - Oxford Univ. Press
CY  - Oxford
ER  -