Inhaltszusammenfassung

Modelling processes with declarative process models, i.e. sets of constraints, allows for a great degree of flexibility in process execution. However, having behavior specified by means of symbolic (textual) constraints comes along with the problem that it is often hard for humans to understand which exact behavior is allowed, and which is not (think for example of checking relationships between constraints). This becomes especially problematic when modellers need to carry out changes to a mo...Modelling processes with declarative process models, i.e. sets of constraints, allows for a great degree of flexibility in process execution. However, having behavior specified by means of symbolic (textual) constraints comes along with the problem that it is often hard for humans to understand which exact behavior is allowed, and which is not (think for example of checking relationships between constraints). This becomes especially problematic when modellers need to carry out changes to a model. For example, a modeller must make sure that any alteration to a model does not introduce any unwanted or non-compliant behavior. As this is often difficult for humans, editing declarative process models currently bears the risk of (accidentally) inducing unforeseen compliance breaches due to some overlooked changes in behavior. In this work, we therefore present an approach to efficiently compute the behavioral changes between a declarative process model M and a corresponding (edited) model $$M’$$M. This supports modellers in understanding the behavioral changes induced by an alteration to the constraints. We implement our approach and show that behavioral changes can be computed within milliseconds even for real-life data-sets.» weiterlesen» einklappen

Autoren