Causal Behavioural Profiles -- Efficient Computation, Applications, and Evaluation

Fundamenta Informaticae (Impact Factor: 0.72). 01/2011; 113(3):399-435. DOI: 10.3233/FI-2011-614
Source: DBLP


Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S- or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.

Download full-text


Available from: Jan Mendling, Dec 26, 2013
  • Source
    • "A behavioral profile returns a relation matrix between activities, each of which is represented using one of the following relationships , +, , or for any pair of activities (a, b) that belong to the process model [7]. However, we have restricted the relationships to be defined among adjacent activities only as per Definition 3. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Events produced from business process execution need identification of process instance. With the lack of a central execution, it is hard to correlate these events to specific cases. Monitoring business processes is useful in conformance checking, compliance enforcement, risk management, and performance analysis. However, all these techniques and approaches need a set of correlated events. We present an approach to fill the gap in real life situations, between execution of unmanaged events and the stack of techniques and approaches that need labeled events at runtime to generate further analysis. This approach works on the unlabeled events, either online (as a stream of events) or offline (as a batch file of events). It deduces the case identifier for each unlabeled event, and displays the results of possible case identifiers with their rankings. Also the generated events can be filed in different event logs with different rankings to be further analyzed by other techniques and approaches.
    The 12th ACS/IEEE International Conference on Computer Systems and Applications; 11/2015
  • Source
    • "Besides existing work on process verification, several researchers also addressed the validation of business processes according to certain functional requirements. Functional requirements are mostly specified using expected execution orders [59] or conformance relationships to reference models, which are checked based on graph comparisons [15], on execution traces [22], on causal dependencies of activities [55], and on equivalence notions using model checking [31]. Besides, there is a unit-testing framework for UML activities [37], which considers alongside execution orders, also the object states. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Modeling and analyzing inter-organizational business processes is complicated substantially by heterogeneous process-modeling languages (e.g., surface vs. analysis languages) as well as by their inherent properties of loose coupling and local control (views). On top, multiple concerns must be addressed when modeling inter- organizational business processes, such as process data, behavior, distribution, and resources management. We believe that more research effort is needed towards establishing a language-oriented foundation for modeling inter-organizational business processes. This paper lays out one direction of language engineering towards this goal, collects generic and specific requirements on a language framework for IOPs, and discusses them tentatively.
    Proceedings of MinoPro 2014, First International Workshop on Modeling Inter-Organizational Processes , Lecture Notes in Informatics Vol. 225; 03/2014
  • Source
    [Show abstract] [Hide abstract]
    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.
    The Computer Journal 11/2012; 55(11). DOI:10.1093/comjnl/bxs014 · 0.79 Impact Factor
Show more