Checking the Realizability of BPMN 2.0 Choreographies - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Checking the Realizability of BPMN 2.0 Choreographies


Choreographies allow business and service architects to specify with a global perspective the requirements of applications built over distributed and interacting software entities. While being a standard for the abstract specification of business workflows and collaboration between services, the Business Process Modeling Notation (BPMN) has only been recently extended into BPMN 2.0 to support an interaction model of choreography, which, as opposed to interconnected interface models, is better suited to top-down development processes. An important issue with choreographies is realizability, i.e., whether peers obtained via projection from a choreography interact as prescribed in the choreography requirements. In this work, we propose a realizability checking approach for BPMN 2.0 choreographies. Our approach is formally grounded on a model transformation into the LOTOS NT process algebra and the use of equivalence checking. It is also completely tool-supported through interaction with the Eclipse BPMN 2.0 editor and the CADP process algebraic toolbox.
Fichier principal
Vignette du fichier
PS-SAC12.pdf (536.55 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00685393 , version 1 (05-04-2012)


  • HAL Id : hal-00685393 , version 1


Pascal Poizat, Gwen Salaün. Checking the Realizability of BPMN 2.0 Choreographies. 27th Symposium On Applied Computing (SAC 2012), Mar 2012, Italy. pp.1927-1934. ⟨hal-00685393⟩
393 View
562 Download


Gmail Mastodon Facebook X LinkedIn More