Skip to Main content Skip to Navigation
Conference papers

Checking the Realizability of BPMN 2.0 Choreographies

Pascal Poizat 1 Gwen Salaün 2 
2 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Gwen Salaün Connect in order to contact the contributor
Submitted on : Thursday, April 5, 2012 - 8:35:05 AM
Last modification on : Wednesday, July 6, 2022 - 4:16:40 AM
Long-term archiving on: : Monday, November 26, 2012 - 12:51:45 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads