Abstract
The Business Process Modelling Notation (BPMN) is currently being used by companies as the Business Process (BP) standard modeling language. In this work, we define a timed semantics of BPMN in terms of the Communicating Sequential Processes + Time (CSP+T) process calculus in order to detail the behaviour of processes within a fixed time span. By adding a formal specification to the response times of activities, temporal constraints, and temporal constraints in communications and task collaboration, we are able to specify and develop the Business Process Task Model (BPTM) of a target BP. We also demonstrate how our proposal can be integrated into the Formal Compositional Verification Approach (FVCA) to allow the use of state–of–the–art MC tools to automatically verify BPTMs. Finally, we examine the application of the proposal to a BPTM verification related to the Customer Relationship Management (CRM) enterprise–business. .
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
OMG. Business Process Modeling Notation – version 1.2. Object Management Group, Massachusetts, USA (2009)
Wong, P., Gibbons, J.: A relative timed semantics for BPMN. Electron. Notes Theor. Comput. Sci. 229(2), 59–75 (2009)
Mendoza, L., Capel, M., Pérez, M., Benghazi, K.: Compositional Model-Checking Verification of Critical Systems. In: Filipe, J., Cordeiro, J. (eds.) Enterprise Information Systems. LNBIP, vol. 19, pp. 213–225. Springer, Heidelberg (2009)
Capel, M., Mendoza, L., Benghazi, K.: Automatic verification of business process integrity. Int. J. Simulation and Process Modelling 4(3/4), 167–182 (2008)
Dijkman, R., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in bpmn. Inf. Softw. Technol. 50(12), 1281–1294 (2008)
Fu, X., Bultan, T., Su, J.: Analysis of interacting BPEL web services. In: WWW 2004: Proceedings of the 13th International Conference on World Wide Web (2004)
Žic, J.: Time–constrained buffer specifications in CSP+T and Timed CSP. ACM Transaction on Programming Languages and Systems 16(6), 1661–1674 (1994)
Plotkin, G.: The origins of structural operational semantics. Journal of Logic and Algebraic Programming 60-61, 3–15 (2004)
Rüf, J., Kropf, T.: Symbolic model checking for a discrete clocked temporal logic with intervals. In: Proceedings of the IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods (1997)
Schneider, S.: Concurrent and Real–Time Systems – The CSP Approach. John Wiley & Sons, Ltd., Chichester (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morales, L.E.M., Tuñón, M.I.C., Pérez, M.A. (2011). A Formalization Proposal of Timed BPMN for Compositional Verification of Business Processes. In: Filipe, J., Cordeiro, J. (eds) Enterprise Information Systems. ICEIS 2010. Lecture Notes in Business Information Processing, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19802-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-19802-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19801-4
Online ISBN: 978-3-642-19802-1
eBook Packages: Computer ScienceComputer Science (R0)