Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs

Abstract : The 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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Monday, May 29, 2017 - 3:53:58 PM
Last modification on : Saturday, June 25, 2022 - 8:59:31 PM
Long-term archiving on: : Wednesday, September 6, 2017 - 11:29:59 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Kais Klai, Jörg Desel. Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs. 14th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 32nd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2012, Stockholm, Sweden. pp.67-83, ⟨10.1007/978-3-642-30793-5_5⟩. ⟨hal-01528733⟩



Record views


Files downloads