research-article

Checking the realizability of BPMN 2.0 choreographies

Authors:

Gwen SalaünAuthors Info & Claims

SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing

Pages 1927 - 1934

https://doi.org/10.1145/2245276.2232095

Published: 26 March 2012 Publication History

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 real-izability, 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.

References

[1]

R. Alur, K. Etessami, and M. Yannakakis. Inference of Message Sequence Charts. IEEE Transactions on Software Engineering, 29(7): 623--633, 2003.

Digital Library

[2]

R. Alur, K. Etessami, and M. Yannakakis. Realizability and Verification of MSC Graphs. Theoretical Computer Science, 331(1): 97--114, 2005.

Digital Library

[3]

S. Basu and T. Bultan. Choreography Conformance via Synchronizability. In Proc. of WWW'11, pages 795--804. ACM Press, 2011.

Digital Library

[4]

M. Bozkurt, M. Harman, and Y. Hassoun. Testing Web Services: A Survey. Technical report, King's College London, 2010.

[5]

D. Brand and P. Zafiropulo. On Communicating Finite-State Machines. J. ACM, 30(2): 323--342, 1983.

Digital Library

[6]

M. Bravetti and G. Zavattaro. Contract Compliance and Choreography Conformance in the Presence of Message Queues. In Proc. of WS-FM'08, volume 5387 of LNCS, pages 37--54. Springer, 2009.

Digital Library

[7]

T. Bultan and X. Fu. Specification of Realizable Service Conversations using Collaboration Diagrams. Service Oriented Computing and Applications, 2(1): 27--39, 2008.

[8]

N. Busi, R. Gorrieri, C. Guidi, R. Lucchi, and G. Zavattaro. Choreography and Orchestration Conformance for System Design. In Proc. of Coordination'06, volume 4038 of LNCS, pages 63--81. Springer, 2006.

Digital Library

[9]

M. Carbone, K. Honda, and N. Yoshida. Structured Communication-Centred Programming for Web Services. In Proc. of ESOP'07, volume 4421 of LNCS, pages 2--17. Springer, 2007.

Digital Library

[10]

D. Champelovier, X. Clerc, H. Garavel, Y. Guerte, V. Powazny, F. Lang, W. Serwe, and G. Smeding. Reference Manual of the LOTOS NT to LOTOS Translator (Version 5.4). INRIA/VASY, 149 pages, 2011.

[11]

P. Crouzen and F. Lang. Smart Reduction. In Proc. of FASE'11, volume 6603 of LNCS, pages 111--126. Springer, 2011.

Digital Library

[12]

G. Decker, O. Kopp, and A. Barros. An Introduction to Service Choreographies. Information Technology, 50(2): 122--127, 2008.

[13]

G. Decker and M. Weske. Local Enforceability in Interaction Petri Nets. In Proc. of BPM'07, volume 4714 of LNCS, pages 305--319. Springer, 2007.

Digital Library

[14]

G. Decker and M. Weske. Interaction-centric Modeling of Process Choreographies. Information Systems, 36(2): 292--312, 2011.

Digital Library

[15]

X. Fu, T. Bultan, and J. Su. Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services. Theoretical Computer Science, 328(1--2): 19--37, 2004.

Digital Library

[16]

H. Garavel, F. Lang, R. Mateescu, and W. Serwe. CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes. In Proc. of TACAS'11, volume 6605 of LNCS, pages 372--387. Springer, 2011.

Digital Library

[17]

ISO. LOTOS --- A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. Technical Report 8807, ISO, 1989.

[18]

R. Kazhamiakin and M. Pistore. Analysis of Realizability Conditions for Web Service Choreographies. In Proc. of FORTE'06, volume 4229 of LNCS, pages 61--76. Springer, 2006.

Digital Library

[19]

J. Li, H. Zhu, and G. Pu. Conformance Validation between Choreography and Orchestration. In Proc. of TASE'07, pages 473--482. IEEE Computer Society, 2007.

Digital Library

[20]

N. Lohmann and K. Wolf. Realizability Is Controllability. In Proc. of WS-FM'09, volume 6194 of LNCS, pages 110--127. Springer, 2010.

Digital Library

[21]

A. Marconi and M. Pistore. Synthesis and Composition of Web Services. In Proc. of SFM'09, volume 5569 of LNCS, pages 89--157. Springer, 2009.

Digital Library

[22]

R. Mateescu, P. Poizat, and G. Salaün. Adaptation of Service Protocols using Process Algebra and On-the-Fly Reduction Techniques. In Proc. of ICSOC'08, volume 5364 of LNCS, pages 84--99. Springer, 2008.

Digital Library

[23]

R. Mateescu and M. Sighireanu. Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus. Sci. Comput. Programming, 46(3): 255--281, 2003.

Digital Library

[24]

R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.

Digital Library

[25]

OMG. Business Process Model and Notation (BPMN) - Version 2.0. January 2011.

[26]

Z. Qiu, X. Zhao, C. Cai, and H. Yang. Towards the Theoretical Foundation of Choreography. In Proc. of WWW'07, pages 973--982. ACM Press, 2007.

Digital Library

[27]

G. Salaün and T. Bultan. Realizability of Choreographies using Process Algebra Encodings. In Proc. of IFM'09, volume 5423 of LNCS, pages 167--182. Springer, 2009.

Digital Library

[28]

S. Uchitel, J. Kramer, and J. Magee. Incremental Elaboration of Scenario-based Specifications and Behavior Models using Implied Scenarios. ACM Transactions on Software Engineering and Methodology, 13(1): 37--85, 2004.

Digital Library

Cited By

Wang SDing ZYang RJiang C(2023)A Complex Behavioral Interaction Analysis Method for Microservice Systems With Bounded BuffersIEEE Transactions on Cloud Computing10.1109/TCC.2023.331903811:4(3713-3724)Online publication date: Oct-2023
https://doi.org/10.1109/TCC.2023.3319038
Halba KGriffor ELbath ADahbura A(2023)IoT Capabilities Composition and Decomposition: A Systematic ReviewIEEE Access10.1109/ACCESS.2023.326018211(29959-30007)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3260182
Zhang MLi HHuang ZHuang YBao F(2022)Analyzing Realizability of BPMN Choreographies2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927990(1-6)Online publication date: 12-Sep-2022
https://doi.org/10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927990
Show More Cited By

Recommendations

Evaluating the appropriateness of the BPMN 2.0 standard for modeling service choreographies: using an extended quality framework

The concept of choreography has emerged over the past years as a foundational concept for capturing and managing collaborative business processes. The latest version of the Business Process Modeling Notation (BPMN 2.0) adopts choreography as a first-...
BPMN 2.0
Realizability of Choreographies Using Process Algebra Encodings

Service-oriented computing has emerged as a new software development paradigm that enables implementation of Web accessible software systems that are composed of distributed services which interact with each other via exchanging messages. Modeling and ...

Comments

comments powered by Disqus.

Information & Contributors

Information

Published In

SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing

March 2012

2179 pages

ISBN:9781450308571

DOI:10.1145/2245276

Conference Chairs:
Sascha Ossowski
University Rey Juan Carlos, Spain
,
Paola Lecca
The Microsoft Research - University of Trento COSBI, Italy

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Agence Nationale de la Recherche

Conference

SAC 2012

Sponsor:

SIGAPP

SAC 2012: ACM Symposium on Applied Computing

March 26 - 30, 2012

Trento, Italy

Acceptance Rates

SAC '12 Paper Acceptance Rate 270 of 1,056 submissions, 26%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
443
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang SDing ZYang RJiang C(2023)A Complex Behavioral Interaction Analysis Method for Microservice Systems With Bounded BuffersIEEE Transactions on Cloud Computing10.1109/TCC.2023.331903811:4(3713-3724)Online publication date: Oct-2023
https://doi.org/10.1109/TCC.2023.3319038
Halba KGriffor ELbath ADahbura A(2023)IoT Capabilities Composition and Decomposition: A Systematic ReviewIEEE Access10.1109/ACCESS.2023.326018211(29959-30007)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3260182
Zhang MLi HHuang ZHuang YBao F(2022)Analyzing Realizability of BPMN Choreographies2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927990(1-6)Online publication date: 12-Sep-2022
https://doi.org/10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927990
Chen BXu HYang QLu GLi H(2022)Modeling Interactions among Cyber-Physical Services2022 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927918(1-6)Online publication date: 12-Sep-2022
https://doi.org/10.1109/DASC/PiCom/CBDCom/Cy55231.2022.9927918
Salaun G(2022)Quantifying the Similarity of BPMN Processes2022 29th Asia-Pacific Software Engineering Conference (APSEC)10.1109/APSEC57359.2022.00050(377-386)Online publication date: Dec-2022
https://doi.org/10.1109/APSEC57359.2022.00050
Haagensen FDebois S(2022)Incentive Alignment Through Secure ComputationsBusiness Process Management10.1007/978-3-031-16103-2_23(343-360)Online publication date: 7-Sep-2022
https://doi.org/10.1007/978-3-031-16103-2_23
Dai FLiu GXu XMo QQiang ZLiang Z(2022)Compatibility checking for cyber‐physical systems based on microservicesSoftware: Practice and Experience10.1002/spe.313152:11(2393-2410)Online publication date: 31-Jul-2022
https://doi.org/10.1002/spe.3131
Salaün G(2021)Quantifying the similarity of non-bisimilar labelled transition systemsScience of Computer Programming10.1016/j.scico.2020.102580202(102580)Online publication date: Feb-2021
https://doi.org/10.1016/j.scico.2020.102580
Dai FYang JMo QZhou HQi L(2021)Modeling Interactions Among Microservices Communicating via FIFO or Bag BuffersSimulation Tools and Techniques10.1007/978-3-030-72795-6_41(505-518)Online publication date: 26-Apr-2021
https://doi.org/10.1007/978-3-030-72795-6_41
Spalazzi LSpegni FCorneli ANaticchia B(2021)Blockchain based choreographies: The construction industry case studyConcurrency and Computation: Practice and Experience10.1002/cpe.674035:16Online publication date: 8-Dec-2021
https://doi.org/10.1002/cpe.6740
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy