Efficient computation of causal behavioural profiles using structural decomposition

  • Authors:
  • Matthias Weidlich;Artem Polyvyanyy;Jan Mendling;Mathias Weske

  • Affiliations:
  • Hasso Plattner Institute at the University of Potsdam, Germany;Hasso Plattner Institute at the University of Potsdam, Germany;Humboldt-Universität zu Berlin, Germany;Hasso Plattner Institute at the University of Potsdam, Germany

  • Venue:
  • PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Identification of behavioural contradictions is an important aspect of software engineering, in particular for checking the consistency between a business process model used as system specification and a corresponding workflow model used as implementation. In this paper, we propose causal behavioural profiles as the basis for a consistency notion, which capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities. Existing notions of behavioural equivalence, such as bisimulation and trace equivalence, might also be applied as consistency notions. Still, they are exponential in computation. Our novel concept of causal behavioural profiles provides a weaker behavioural consistency notion that can be computed efficiently 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.