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.
Type de document :
Communication dans un congrès
27th Symposium On Applied Computing (SAC 2012), Mar 2012, Italy. pp.1927-1934, 2012
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger
Contributeur : Gwen Salaün <>
Soumis le : jeudi 5 avril 2012 - 08:35:05
Dernière modification le : jeudi 11 octobre 2018 - 08:48:04
Document(s) archivé(s) le : lundi 26 novembre 2012 - 12:51:45


Fichiers produits par l'(les) auteur(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, 2012. 〈hal-00685393〉



Consultations de la notice


Téléchargements de fichiers