Behavior equivalence and compatibility of business process models with complex correspondences

M. Weidlich, R.M. Dijkman, M.H. Weske

Research output: Contribution to journalArticleAcademicpeer-review

22 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)1398-1418
JournalThe Computer Journal
Volume55
Issue number11
DOIs
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'Behavior equivalence and compatibility of business process models with complex correspondences'. Together they form a unique fingerprint.

Cite this