Article

Free access

BProVe: a formal verification framework for business process models

Authors:

Flavio Corradini,

Fabrizio Fornari,

Francesco Tiezzi,

Andrea VandinAuthors Info & Claims

ASE '17: Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering

Pages 217 - 228

Published: 30 October 2017 Publication History

Abstract

Business Process Modelling has acquired increasing relevance in software development. Available notations, such as BPMN, permit to describe activities of complex organisations. On the one hand, this shortens the communication gap between domain experts and IT specialists. On the other hand, this permits to clarify the characteristics of software systems introduced to provide automatic support for such activities. Nevertheless, the lack of formal semantics hinders the automatic verification of relevant properties.

This paper presents a novel verification framework for BPMN 2.0, called BProVe. It is based on an operational semantics, implemented using MAUDE, devised to make the verification general and effective. A complete tool chain, based on the Eclipse modelling environment, allows for rigorous modelling and analysis of Business Processes. The approach has been validated using more than one thousand models available on a publicly accessible repository. Besides showing the performance of BProVe, this validation demonstrates its practical benefits in identifying correctness issues in real models.

References

[1]

A. Lindsay, D. Downs, and K. Lunn, “Business processes attempts to find a definition,” Information and Software Technology, vol. 45, no. 15, pp. 1015–1019, 2003.

[2]

M. Reichert and B. Weber, “Business process compliance,” in Enabling Flexibility in Process-Aware Information Systems. Springer, 2012, pp. 297–320.

[3]

O. Pastor, “Model-Driven Development in Practice: From Requirements to Code,” in SOFSEM 2017: Theory and Practice of Computer Science, ser. LNCS. Springer, 2017, vol. 10139, pp. 405–410.

[4]

J. Li, R. Jeffery, K. H. Fung, L. Zhu, Q. Wang, H. Zhang, and X. Xu, “A Business Process-Driven Approach for Requirements Dependency Analysis,” in Business Process Management, ser. LNCS. Springer, 2012, vol. 7481, pp. 200–215.

Digital Library

[5]

A. M. de Vasconcelos, J. L. de la Vara, J. Sanchez, and O. Pastor, “Towards CMMI-compliant Business Process-Driven Requirements Engineering,” in Quality of Information and Communications Technology. IEEE, 2012, pp. 193–198.

Digital Library

[6]

A. Aldazabal, T. Baily, F. Nanclares, A. Sadovykh, C. Hein, and T. Ritter, “Automated model driven development processes,” in ECMDA workshop on Model Driven Tool and Process Integration, 2008, pp. 361 – 375.

[7]

OASIS WSBPEL TC, “Web Services Business Process Execution Language Version 2.0,” OASIS, Tech. Rep., April 2007, available at http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.

[8]

OMG, “Business Process Model and Notation (BPMN V 2.0),” 2011.

[9]

R. M. Dijkman, M. Dumas, and C. Ouyang, “Semantics and analysis of business process models in BPMN,” Information and Software Technology, vol. 50, no. 12, pp. 1281–1294, 2008.

Digital Library

[10]

P. Y. Wong and J. Gibbons, “Formalisations and applications of BPMN,” Science of Computer Programming, vol. 76, no. 8, pp. 633–650, 2011.

Digital Library

[11]

D. Prandi, P. Quaglia, and N. Zannone, “Formal Analysis of BPMN Via a Translation into COWS,” in Coordination Models and Languages, ser. LNCS. Springer, 2008, vol. 5052, pp. 249–263.

Digital Library

[12]

F. Puhlmann, “Soundness Verification of Business Processes Specified in the Pi-Calculus,” in On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS, ser. LNCS. Springer, 2007, vol. 4803, pp. 6–23.

Digital Library

[13]

G. D. Plotkin, “A structural approach to operational semantics,” J. Log. Algebr. Program., vol. 60, no. 61, pp. 17–139, 2004.

[14]

A. Polyvyanyy and C. Bussler, “The structured phase of concurrency,” in Seminal Contributions to Information Systems Engineering. Springer, 2013, pp. 257–263.

[15]

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Mart´ı-Oliet, J. Meseguer, and C. Talcott, All about maude-a high-performance logical framework: how to specify, program and verify systems in rewriting logic. Springer, 2007.

Digital Library

[16]

M. Kunze, P. Berger, and M. Weske, “BPM Academic Initiative - Fostering Empirical Research,” in Demonstration Track of the 10th International Conference on Business Process Management, vol. 940, 2012, pp. 1 – 5.

[17]

M. Weske, Business Process Management. Springer, 2012.

[18]

M. Muehlen and J. Recker, “How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation,” in Advanced Information Systems Engineering, ser. LNCS. Springer, 2008, vol. 5074, pp. 465–479.

Digital Library

[19]

M. T. Wynn, H. M. W. Verbeek, W. M. van der Aalst, A. H. ter Hofstede, and D. Edmond, “Business process verification-finally a reality!” Business Process Management Journal, vol. 15, no. 1, pp. 74– 92, 2009.

[20]

R. Laue and J. Mendling, “The Impact of Structuredness on Error Probability of Process Models,” in Information Systems and e-Business Technologies, ser. LNBIP. Springer, 2008, vol. 5, pp. 585–590.

[21]

B. Kiepuszewski, A. H. M. ter Hofstede, and C. J. Bussler, “On structured workflow modelling,” in International Conference on Advanced Information Systems Engineering, ser. LNCS, vol. 1789.

Digital Library

[22]

Springer, 2000, pp. 431–445.

[23]

A. Polyvyanyy, L. Garc´ıa-Ba˜nuelos, and M. Dumas, “Structuring acyclic process models,” Information Systems, vol. 37, no. 6, pp. 518–538, 2012.

Digital Library

[24]

A. Polyvyanyy, L. Garcia-Banuelos, D. Fahland, and M. Weske, “Maximal Structuring of Acyclic Process Models,” The Computer Journal, vol. 57, no. 1, pp. 12–35, 2014.

[25]

S. Morimoto, “A Survey of Formal Verification for Business Process Modeling,” in International Conference on Computational Science, ser. LNCS. Springer, 2008, vol. 5102, pp. 514–522.

Digital Library

[26]

R. Breu, S. Dustdar, J. Eder, C. Huemer, G. Kappel, J. Kopke, P. Langer, J. Mangler, J. Mendling, G. Neumann, S. Rinderle-Ma, S. Schulte, S. Sobernig, and B. Weber, “Towards Living Inter-organizational Processes,” in 15th Conference on Business Informatics. IEEE, 2013, pp. 363–366.

Digital Library

[27]

W. M. van der Aalst, “Structural characterizations of sound workflow nets,” Computing Science Reports, vol. 96, no. 23, pp. 18–22, 1996.

[28]

F. Corradini, A. Polini, B. Re, and F. Tiezzi, “An operational semantics of BPMN collaboration,” in 12th International Conference Formal Aspects of Component Software, ser. LNCS, vol. 9539. Springer, 2015, pp. 161–180.

Digital Library

[29]

J. Meseguer, “Conditional rewriting logic as a unified model of concurrency,” Theoretical computer science, vol. 96, no. 1, pp. 73–155, 1992.

Digital Library

[30]

——, “Twenty years of rewriting logic,” J. Log. Algebr. Program., vol. 81, no. 7-8, pp. 721–781, 2012.

[31]

C. Ellison and G. Rosu, “An executable formal semantics of C with applications,” in 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012, pp. 533–544.

Digital Library

[32]

C. Hathhorn, C. Ellison, and G. Rosu, “Defining the undefinedness of C,” in 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015, pp. 336–345.

Digital Library

[33]

D. Bogdanas and G. Rosu, “K-java: A complete semantics of java,” in 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015, pp. 445–456.

Digital Library

[34]

D. Park, A. Stefanescu, and G. Rosu, “KJS: a complete formal semantics of javascript,” in 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015, pp. 346–356.

Digital Library

[35]

S. Eker, J. Meseguer, and A. Sridharanarayanan, “The Maude LTL model checker,” Electronic Notes in Theoretical Computer Science, vol. 71, pp. 162–187, 2004.

[36]

A. Pnueli, “The temporal logic of programs,” in 18th Annual Symposium on Foundations of Computer Science. IEEE, 1977, pp. 46–57.

Digital Library

[37]

F. Corradini, F. Fornari, A. Polini, B. Re, F. Tiezzi, and A. Vandin, “BProVe: Tool Support for Business Process Verification,” in 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017.

Digital Library

[38]

M. Kunze, A. Luebbe, M. Weidlich, and M. Weske, “Towards understanding process modeling the case of the BPM academic initiative,” in Business Process Model and Notation, ser. LNBIP. Springer, 2011, vol. 95, pp. 44–58.

[39]

H. Groefsema and D. Bucur, “A survey of formal business process verification: From soundness to variability,” in International Symposium on Business Modeling and Software Design, 2013, pp. 198–203.

[40]

M. Fellman and A. Zasada, “State-of-the-Art of Business Process Compliance Approaches: A Survey,” in 7th International Workshop on Enterprise Modeling and Information Systems Architectures, 2016, pp. 60–63.

[41]

P. Van Gorp and R. Dijkman, “A visual token-based formalization of BPMN 2.0 based on in-place transformations,” Information and Software Technology, vol. 55, no. 2, pp. 365–394, 2013.

Digital Library

[42]

P. M. Kwantes, P. Van Gorp, J. Kleijn, and A. Rensink, “Towards Compliance Verification Between Global and Local Process Models,” in Graph Transformation, ser. LNCS. Springer, 2015, vol. 9151, pp. 221–236.

[43]

N. El-Saber and A. Boronat, “BPMN Formalization and Verification Using Maude,” in Workshop on Behaviour Modelling-Foundations and Applications. ACM, 2014, pp. 1–12.

Digital Library

[44]

E. Börger and B. Thalheim, “A Method for Verifiable and Validatable Business Process Modeling,” in Advances in Software Engineering, ser. LNCS. Springer, 2008, vol. 5316, pp. 59–115.

Digital Library

[45]

F. Kossak, C. Illibauer, V. Geist, J. Kubovy, C. Natschlager, T. Ziebermayr, T. Kopetzky, B. Freudenthaler, and K. D. Schewe, A Rigorous Semantics for BPMN 2.0 Process Diagrams. Springer, 2014.

Digital Library

[46]

W. Huai, X. Liu, and H. Sun, “Towards Trustworthy Composite Service Through Business Process Model Verification,” in 7th International Conference on Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing. IEEE, 2010, pp. 422– 427.

Digital Library

[47]

R. Koniewski, A. Dzielinski, and K. Amborski, “Use of Petri Nets and Business Processes Management Notation in Modelling and Simulation of Multimodal Logistics Chains,” in 20th European Conference on Modeling and Simulation, 2006, pp. 28–31.

[48]

M. Ramadan, H. G. Elmongui, and R. Hassan, “BPMN formalisation using coloured petri nets,” in International Conference on Software Engineering & Applications. ACTA, 2011.

[49]

A. Awad, G. Decker, and N. Lohmann, “Diagnosing and Repairing Data Anomalies in Process Models,” in Business Process Management Workshops, ser. LNBIP. Springer, 2010, vol. 43, pp. 5–16.

[50]

J. Ye and W. Song, “Transformation of BPMN Diagrams to YAWL Nets,” Journal of Software, vol. 5, no. 4, 2010.

[51]

G. Decker, R. Dijkman, M. Dumas, and L. Garc´ıa-Ba˜nuelos, “Transforming BPMN diagrams into YAWL nets,” in Business Process Management, ser. LNCS. Springer, 2008, vol. 5240, pp. 386–389.

Digital Library

[52]

A. Kheldoun, K. Barkaoui, and M. Ioualalen, “Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach,” in Business Process Management, ser. LNCS. Springer, 2015, vol. 9253, pp. 55–71.

Digital Library

[53]

——, “Formal verification of complex business processes based on highlevel Petri nets,” Information Sciences, vol. 385-386, pp. 39–54, 2017.

Digital Library

[54]

P. Y. H. Wong and J. Gibbons, “A Process Semantics for BPMN,” in Formal Methods and Software Engineering, ser. LNCS. Springer, 2008, vol. 5256, pp. 355–374.

Digital Library

[55]

F. Puhlmann and M. Weske, “Investigations on Soundness Regarding Lazy Activities,” in Business Process Management, ser. LNCS. Springer, 2006, vol. 4102, pp. 145–160.

Digital Library

[56]

F. Corradini, A. Polini, A. Polzonetti, and B. Re, “Business Processes Verification for e-Government Service Delivery,” Information Systems Management, vol. 27, no. 4, pp. 293–308, Oct. 2010.

Digital Library

[57]

A. Polini, A. Polzonetti, and B. Re, “Formal methods to improve public administration business processes,” RAIRO - Theor. Inf. and Applic., vol. 46, no. 2, pp. 203–229, 2012.

[58]

F. Corradini, A. Polzonetti, B. Re, and D. Falcioni, “An eclipse plug-in for formal verification of BPMN processes,” in 3rd International Conference on Communication Theory, Reliability, and Quality of Service, June 2010, pp. 144–149.

Digital Library

[59]

P. Y. H. Wong and J. Gibbons, “Verifying Business Process Compatibility (Short Paper),” in 8th International Conference on Quality Software. IEEE, 2008, pp. 126–131.

Digital Library

Cited By

Schneid KUsener CThöne SKuchen HTophinke CHung CPapadopoulos G(2019)Static analysis of BPMN-based process-driven applicationsProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297289(66-74)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297289
Corradini FFornari FPolini ARe BTiezzi FVandin ARosu GDi Penta MNguyen T(2017)BProVe: tool support for business process verificationProceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering10.5555/3155562.3155682(937-942)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.5555/3155562.3155682

Recommendations

BProVe: tool support for business process verification
ASE '17: Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering

This demo introduces BProVe, a tool supporting automated verification of Business Process models. BProVe analysis is based on a formal operational semantics defined for the BPMN 2.0 modelling language, and is provided as a freely accessible service ...
BPMN Formalization and Verification using Maude
BM-FA '14: Proceedings of the 2014 Workshop on Behaviour Modelling-Foundations and Applications

OMG's Business Process Model and Notation (BPMN) standard provides an informal specification of a technology independent modelling language for designing business processes. However, BPMN models may include structural issues that hinder their design. In ...
Formal Semantics and Analysis of Component Connectors in Reo

We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components that comprise a complex system, into a coherent collaboration. The formal ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ASE '17: Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering

October 2017

1033 pages

ISBN:9781538626849

General Chair:
Grigore Rosu
University of Illinois at Urbana-Champaign, USA
,
Program Chairs:
Massimiliano Di Penta
University of Sannio, Italy
,
Tien N. Nguyen
University of Texas at Dallas, USA

Sponsors

Publisher

IEEE Press

Publication History

Published: 30 October 2017

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 82 of 337 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
173
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)13

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Schneid KUsener CThöne SKuchen HTophinke CHung CPapadopoulos G(2019)Static analysis of BPMN-based process-driven applicationsProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297289(66-74)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297289
Corradini FFornari FPolini ARe BTiezzi FVandin ARosu GDi Penta MNguyen T(2017)BProVe: tool support for business process verificationProceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering10.5555/3155562.3155682(937-942)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.5555/3155562.3155682

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Figures

Tables

Media

View Table of Conten