Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs

Abstract

International audienceThe Symbolic Observation Graph (SOG) associated with a labelled transition system and a subset of its labels is an efficient BDD-based abstraction representing the behavior of a system. The goal of this paper is to compose SOGs such that the resulting SOG is still small but represents the behavior of the composed business process in an appropriate way. In particular, we would like to deduce the properties of a composed business process by analysing the composition of the SOGs associated with its components. This question was already answered for the deadlock-freeness property in previous work. In this paper, we extend this result to other generic properties: the so-called soundness properties. These properties guarantee the absence of livelocks, deadlocks and other anomalies that can be formulated without domain knowledge. Thus, we show how the SOG can be adapted and used so that the verification of several variants of the soundness property can be performed modularly

Generic and Specific Compatibility Criteria for Web Service Composition

“…This property guarantees the absence of several types of anomalies in a Web service model and can be formulated without domain knowledge. The work presented in this paper is an extended version of (Klai, Ochi et al, 2013) and is in line with our previous work (Klai, Tata et al, 2009;Klai & Desel, 2012;Klai, Ochi et al, 2013;Klai et al, 2011). In Klai, Tata et al (2009) and (Klai et al, 2011), the SOG has been used to check only the deadlock freeness property of inter-organizational workflows.…”

“…Given an oWF-net N, the observed behavior, denoted λ (see (Klai & Desel, 2012) for a formal definition) is defined as a mapping applied on the reachable markings, R(N * ,m0), of the inner net N * . In the remaining part of this paper, we assume an additional virtual observed transition term belonging to Obs.…”

“…In practice, since an aggregate is represented by a BDD, the computation of the corresponding attributes (l and λ) should be performed symbolically (using sets operations). A symbolic algorithm for the computation of the observed behavior is proposed in (Klai & Desel, 2012) while a symbolic algorithm for the detection of cycles is proposed in (Haddad, Ilié et al, 2004).…”

“…In Klai, Tata et al (2009) and (Klai et al, 2011), the SOG has been used to check only the deadlock freeness property of inter-organizational workflows. In (Klai and Desel, 2012) and (Klai, Ochi et al, 2013), soundness property with different variants has been considered. This paper enhances our above cited work with additional experimental results.…”

Checking Compatibility of Web Services Behaviorally

“…In practice, since an aggregate is represented by a BDD, the computation of the corresponding observed behavior should be performed symbolically (using sets operations). A symbolic algorithm for the computation of the observed behavior is proposed in [7].…”