Abstract
Formal specifications and modeling languages can be used to provide support for Business Process (BP) analysts and designers to verify the behavior of BPs with respect to business performance indicators (i.e., service time, waiting time or queue size). This article presents the application of the Timed Automata (TA) formal language to check BPs modeled with Business Process Model and Notation (BPMN) using the model checking verification technique. Also, a set of transformation rules and two algorithms are introduced to obtain TA-networks from BPMN models, allowing the formal specification of a BP-task model equivalent to the BPMN model. The approach presented here contributes to conduct the qualitative analysis of BPMN models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This example was taken from: http://www.visual-paradigm.com/tutorials/bpmn- tutorial-with-example.jsp.
- 2.
References
Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30080-9_7
Capel, M., Mendoza, L., Benghazi, K.: Automatic verification of business process integrity. Int. J. Simul. Process Model. 4(3/4), 167–182 (2008)
Cheikhrouhou, S., Kallel, S., Guermouche, N., Jmaiel, M.: Enhancing formal specification and verification of temporal constraints in business processes. In: Proceedings of 2014 IEEE International Conference on Services Computing, SCC 2014, pp. 701–708. IEEE Computer Society, Washington (2014). http://dx.doi.org/10.1109/SCC.2014.97
Cheikhrouhou, S., Kallel, S., Guermouche, N., Jmaiel, M.: The temporal perspective in business process modeling: a survey and research challenges. Serv. Oriented Comput. Appl. 9(1), 75–85 (2015). http://dx.doi.org/10.1007/s11761-014-0170-x
Kossak, F., et al.: How the semantic model can be used. In: A Rigorous Semantics for BPMN 2.0 Process Diagrams, pp. 153–159. Springer International Publishing, Heidelberg (2014). http://dx.doi.org/10.1007/978-3-319-09931-6_5
Mallek, S., Daclin, N., Chapurlat, V., Vallespir, B.: Enabling model checking for collaborative process analysis: from BPMN to ‘Network of Timed Automata’. Enterp. Inf. Syst. 9(3), 279–299 (2015). http://dx.doi.org/10.1080/17517575.2013.879211
Mendoza, L., Marius, A., Pérez, M., Grimán, A.: Critical success factors for a customer relationship management strategy. Inf. Softw. Technol. 49(8), 913–945 (2007)
Morimoto, S.: A survey of formal verification for business process modeling. In: Bubak, M., Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5102, pp. 514–522. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69387-1_58
OMG: Business Process Model and Notation - v2.0. Object Management Group, Massachusetts (2011). http://www.omg.org/spec/BPMN/2.0/PDF
Paternò, F.: Task models in interactive software systems. In: Handbook of Software Engineering and Knowledge Engineering: Recent Advances. World Scientific Publishing Co., Inc., River Edge (2001)
Rüf, J., Kropf, T.: Symbolic model checking for a discrete clocked temporal logic with intervals. In: Proceedings of IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods, pp. 146–163. Chapman & Hall Ltd, London (1997)
Watahiki, K., Ishikawa, F., Hiraishi, K.: Formal verification of business processes with temporal and resource constraints. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), pp. 1173–1180. IEEE Computer Society, Los Alamitos (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Mendoza Morales, L.E., Monsalve, C., Villavicencio, M. (2016). Application of Formal Methods to Verify Business Processes. In: Ribeiro, L., Lecomte, T. (eds) Formal Methods: Foundations and Applications. SBMF 2016. Lecture Notes in Computer Science(), vol 10090. Springer, Cham. https://doi.org/10.1007/978-3-319-49815-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-49815-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49814-0
Online ISBN: 978-3-319-49815-7
eBook Packages: Computer ScienceComputer Science (R0)