A. Bouhoula, J. Jouannaud, and J. Meseguer, Specification and Proof in Membership Equational Logic, Theoretical Computer Science, vol.236, issue.1, pp.35-132, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099079

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude-A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, LNCS, vol.4350, 2007.

F. Corradini, F. Fornari, A. Polini, B. Re, F. Tiezzi et al., BProVe: A Formal Verification Framework for Business Process Models, Proc. of ASE, pp.217-228, 2017.

R. Dijkman, M. Dumas, and C. Ouyang, Semantics and Analysis of Business Process Models in BPMN. Information and Software Technology, vol.50, pp.1281-1294, 2008.

F. Durán, C. Rocha, and G. Salaün, Stochastic analysis of BPMN with time in rewriting logic, Science of Computer Programming, vol.168, pp.1-17, 2018.

F. Durán and G. Salaün, Verifying Timed BPMN Processes using Maude, Proc. of COORDINATION, vol.10319, pp.219-236, 2017.

N. El-saber and A. Boronat, BPMN Formalization and Verification using Maude, Proc. of BM-FA'14, pp.1-8, 2014.

J. Esparza, Reachability in Live and Safe Free-choice Petri Nets is NP-complete, Theoretical Computer Science, vol.198, pp.211-224, 1998.

. Iso/iec, International Standard 19510, Information technology-Business Process Model and Notation, 2013.

A. Kheldoun, K. Barkaoui, and M. Ioualalen, Specification and Verification of Complex Business Processes-A High-Level Petri Net-Based Approach, Proc. of BPMN, vol.9253, pp.55-71, 2015.

A. Krishna, P. Poizat, and G. Salaün, VBPMN: Automated Verification of BPMN Processes, Proc. of IFM'17, vol.10510, pp.323-331, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01591665

R. Mateescu, G. Salaün, and L. Ye, Quantifying the Parallelism in BPMN Processes using Model Checking, Proc. of CBSE'14, pp.159-168, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01016412

E. Mayr, An Algorithm for the General Petri Net Reachability Problem, SIAM Journal on Computing, vol.13, issue.3, pp.441-460, 1984.

J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science, vol.96, issue.1, pp.73-155, 1992.

L. E. Morales, M. I. Capel, and M. A. Pérez, Conceptual Framework for Business Processes Compositional Verification. Information and Software Technology, vol.54, pp.149-161, 2012.

P. C. Olveczky and J. Meseguer, Semantics and Pragmatics of Real-Time Maude. Higher-Order and Symbolic Computation, vol.20, pp.161-196, 2007.

O. , Business Process Model and Notation (BPMN)-Version 2.0, 2011.

P. Poizat and G. Salaün, Checking the Realizability of BPMN 2.0 Choreographies, Proc. of SAC'12, pp.1927-1934, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00685393

Y. Sun and J. Su, Computing Degree of Parallelism for BPMN Processes, Proc. of ICSOC'11, vol.7084, pp.1-15, 2011.

P. Wong and J. Gibbons, A Process Semantics for BPMN, Proc. of ICFEM'08, vol.5256, pp.355-374, 2008.

M. T. Wynn, H. M. 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, issue.1, pp.74-92, 2009.