Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs

Résumé

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.
Fichier principal
Vignette du fichier
978-3-642-30793-5_5_Chapter.pdf (348.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01528733 , version 1 (29-05-2017)

Licence

Paternité

Identifiants

Citer

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⟩
138 Consultations
154 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More