COMPOSITIONAL VERIFICATION OF BUSINESS PROCESSES MODELLED WITH BPMN

Luis E. Mendoza Morales, Manuel I. Capel Tuñón, María A. Pérez

Abstract

A specific check that is required to be performed as part of the Business Process Modelling (BPM) is on whether the activities and tasks described by Business Processes (BPs) are sound and well–coordinated. In this work we present how the Model–Checking verification technique for software can be integrated within a Formal Compositional Verification Approach (FVCA) to allow the automatic verification of BPs modelled with Business Process Modelling Notation (BPMN). The FVCA is based on a formal specification language with composition constructs. A timed semantics of BPMN defined in terms of the Communicating Sequential Processes + Time (CSP+T) extends untimed BPMN modelling entities with timing constrains in order to detail the behavior of BPs during the execution of real scenarios that they represent. With our proposal we are able to specify and to develop the Business Process Task Model (BPTM) of a target business system. In order to show a practical use of our proposal, a BPTM of an instance of a BPM enterprise–project related to the Customer Relationship Management (CRM) business is presented.

References

  1. Aalst, W. (2002). Making Work Flow: On the Application of Petri Nets to Business Process Management, LNCS 2360: Application and Theory of Petri Nets 2002, pages 1-22. Springer-Verlag, Berlin.
  2. Alur, R. and Dill, D. (1994). A theory of timed automata. Theoretical Computer Science, 126(2):183-235.
  3. Capel, M., Mendoza, L., and Benghazi, K. (2008). Automatic verification of business process integrity. Int. J. Simulation and Process Modelling, 4(3/4):167-182.
  4. Clarke, E., Grumberg, O., and Peled, D. (2000). Model Checking. MIT. The MIT Press, Cambridge, USA.
  5. Díaz, G., Pardo, J.-J., Cambronero, M.-E., Valero, V., and Cuartero, F. (2005). Automatic Translation of WS-CDL Choreographies to Timed Automata, LNCS 3670: Formal Techniques for Computer Systems and Business Processes, pages 230-242. Springer-Verlag, Berlin.
  6. Eriksson, H.-E. and Penker, M. (1998). Business Modeling With UML: Business Patterns at Work. John Wiley & Sons, Inc., New York, USA.
  7. Kruchten, P. (2003). The Rational Unified Process: An Introduction, Second Edition. Addison-Wesley Longman Publishing Co., Inc., Boston, USA, 3rd edition.
  8. Ma, S., Zhang, L., and He, J. (2008). Towards formalization and verification of unified business process model based on pi calculus. Proc. ACIS International Conference on Software Engineering Research, Management and Applications, 1:93-101.
  9. Mendoza, L., Marius, A., Pérez, M., and Grimán, A. (2007). Critical success factors for a customer relationship management strategy. Inf. Softw. Technol., 49(8):913- 945.
  10. Morimoto, S. (2005). A Survey of Formal Verification for Business Process Modeling, LNCS 5102: Proc. 8th International Conference on Computational Science (ICCS 2008), pages 514-522. Springer-Verlag, Berlin.
  11. OASIS (2007). Web Services Business Process Execution Language Version 2.0. OASIS Open, Billerica, USA.
  12. OMG (2009). Business Process Modeling Notation - version 1.2. Object Management Group, Massachusetts, USA.
  13. Paternò, F. (2001). Handbook of Software Engineering And Knowledge Engineering: Recent Advances, chapter Task Models in Interactive Software Systems. World Scientific Publishing Co., Inc., River Edge, USA.
  14. Roscoe, A. (1997). The Theory and Practice of Concurrency. Prentice-Hall International Ltd., Hertfordshire UK.
  15. Rüf, J. and Kropf, T. (1997). 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, pages 146-163, London, UK. Chapman & Hall, Ltd.
  16. Schneider, S. (2000). Concurrent and Real-time Systems - The CSP Approach. John Wiley & Sons, Ltd., Chichester, England.
  17. Z?ic, J. (1994). Time-constrained buffer specifications in CSP+T and Timed CSP. ACM Transaction on Programming Languages and Systems, 16(6):1661-1674.
  18. Wong, P. and Gibbons, J. (2008). A Process Semantics for BPMN, LNCS 5256: Proc. 10th International Conference on Formal Engineering Methods (ICFEM 2008), pages 355-374. Springer-Verlag, Berlin.
Download


Paper Citation


in Harvard Style

E. Mendoza Morales L., I. Capel Tuñón M. and A. Pérez M. (2010). COMPOSITIONAL VERIFICATION OF BUSINESS PROCESSES MODELLED WITH BPMN . In Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-989-8425-06-5, pages 113-122. DOI: 10.5220/0002974101130122


in Bibtex Style

@conference{iceis10,
author={Luis E. Mendoza Morales and Manuel I. Capel Tuñón and María A. Pérez},
title={COMPOSITIONAL VERIFICATION OF BUSINESS PROCESSES MODELLED WITH BPMN},
booktitle={Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2010},
pages={113-122},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002974101130122},
isbn={978-989-8425-06-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - COMPOSITIONAL VERIFICATION OF BUSINESS PROCESSES MODELLED WITH BPMN
SN - 978-989-8425-06-5
AU - E. Mendoza Morales L.
AU - I. Capel Tuñón M.
AU - A. Pérez M.
PY - 2010
SP - 113
EP - 122
DO - 10.5220/0002974101130122