Checking Realizability of a Timed Business Processes Choreography

Manuel I. Capel

2017

Abstract

A business process (BP) can be understood as a set of related, structured, interacting services acting as peers, according to an intended choreography that is capable of giving complex functionality to customers. Several authors have made progress in solving the ”choreography realization” problem. The research work carried out in this paper amounts to analyzing and automatically checking the realizability of the defined choreography for services that communicate through messages in a general, distributed, and highly parallel system.

References

  1. Aalst, W. (2009). Challenges in business process analysis. In In: Enterprise Information Systems. Lecture Notes in Business Information Processing, v. 12, 27:42. Springer, Berlin, Heidelberg.
  2. Arkin A., Askary S., e. (2005). Committee draft. In Services Business Process Execution Language Version 2.0. WS-BPEL TC OASIS.
  3. Baacke L., Mettler T., R. R. (2009). Component-based process in health care. In In:17th European Conference on Information Systems.
  4. Bezem M., Klop J.W., R. d. V. (2003). “Terese”. Term rewriting systems. Cambridge University Press.
  5. Capel M.I., M. L. (2014). Choreography modeling compliance for timed business models. In In: Barjis J., Pergl R. (eds) Enterprise and Organizational Modeling and Simulation. EOMAS 2014. Lecture Notes in Business Information Processing, vol 191, 202:218.
  6. Cerone, A. (2002). From process algebra to visual language. In Proceedings of the Conference on Application and Theory of Petri Nets: Formal Methods in Software Engineering and Defence Systems, v. 12.
  7. Dongen B., A. W. (2004). Multi-phase process mining: Building instance graphs. In In: Conceptual Modeling-ER 2004. Lecture Notes in Computer Science, v. 3288, 362:376. Heidelberg:Springer.
  8. FormSys (2005). Failures-Divergence Refinement - FDR2 User Manual. Formal Systems Europe Ltd, Oxford, 2nd edition.
  9. Garavel A., e. a. (2011). Cadp 2010: A toolbox for the construction and analysis of distributed processes. In Proceedings of TACAS'11,v.6605 of LNCS, 372:387. Springer.
  10. González A., Mendoza L.E., C. M. (2011). Btransformer: A tool for bpmn to csp+t transformation. In Proceedings of the 13th International Conference on Enterprise Information Systems (ICEIS), Volume 3, Beijing, China, 8-11 June, 2011. ScitePress.
  11. Jouault F., Allilaire F., e. a. (2008). Atl: A model tranformation tool. In Science of Computer Programming, 72, 31:39.
  12. Ma S., Zhang L., H. J. (2008). Towards formalization and verification of unified business process model based on pi calculus. In Proceedings ACIS International. Conference on Software Engineering Research, Management and Applications 1.
  13. Mendoza L.E., Capel M.I., P. M. (2012). Conceptual framework for business processes compositional verification . Information and Software Technology,54,149:161.
  14. OASIS (2007). Web services business process execution language version 2.0. http://docs.oasisopen.org/wsbpel/2.0/wsbpel-v2.0.pdf.
  15. OMG (2011). Business Process Model and Notation (BPMN)-version 2.0 .
  16. Poizat P., S. G. (2012). Checking the realizability of bpmn 2.0 choreographies. In TEMPLATE'06, 1st International Conference on Template Production.In: 27th Simposium of Applied Computing, 1927:1934, Riva del Garda(Italy), March 25-29. ACM.
  17. Puhlmann, F. (2007). Soundness verification of business processes specified in the pi-calculus. In Lecture Notes in Computer Science, no.4803: 6-23. Elsevier.
  18. Rozinat A., A. W. (2006). Conformance testing: Measuring the fit and appropriateness of event logs and process models. In In: Business Process Management Workshops. Lecture Notes in Computer Science. Elsevier.
  19. Schneider, S. (2000). Concurrent and Real-Time Systems - The CSP Approach. John Wiley & Sons, Ltd.
  20. Thatte, S. (2001). XLANG: Web Services for Business Process Design.Microsoft Corporation, 2001.
  21. W3C (November 9, 2005). W3c candidate recommendation. In Web Services Choreography Description Language Version 1.0. http://www.w3.org/TR/ws-cdl-10/.
  22. Wong P.Y.H., G. J. (2008). A process semantics for bpmn. In International Conference on Formal Engineering Methods, ICFEM 2008 (Kitakyushu-City), Japan, October 27-31, 2008. In Lecture Notes in Computer Science 5256, 355:374. Heidelberg:SpringerS.
  23. Zic, J. (1994). Time-constrained buffer specifications in csp+t and timed csp. In ACM TOPLAS,16(6), 1661:1674. ACM.
Download


Paper Citation


in Harvard Style

I. Capel M. (2017). Checking Realizability of a Timed Business Processes Choreography . In Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER, ISBN 978-989-758-243-1, pages 441-448. DOI: 10.5220/0006300404410448


in Bibtex Style

@conference{closer17,
author={Manuel I. Capel},
title={Checking Realizability of a Timed Business Processes Choreography},
booktitle={Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER,},
year={2017},
pages={441-448},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006300404410448},
isbn={978-989-758-243-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Conference on Cloud Computing and Services Science - Volume 1: CLOSER,
TI - Checking Realizability of a Timed Business Processes Choreography
SN - 978-989-758-243-1
AU - I. Capel M.
PY - 2017
SP - 441
EP - 448
DO - 10.5220/0006300404410448