Abstract
Business Process Modelling Notation (BPMN) intends to bridge the gap between business process design and implementation. Previously we provided a process semantics to a subset of BPMN in the language of Communicating Sequential Processes (CSP). This semantics allows developers to formally analyse and compare BPMN diagrams using CSP’s traces and failures refinements. In this paper we introduce a comprehensive set of operations for constructing BPMN diagrams, provide them a CSP semantics, and characterise the conditions under which the operations are monotonic with respect to CSP refinements, thereby allowing compositional development of business processes.
Partly funded by Microsoft Research.
Chapter PDF
Similar content being viewed by others
Keywords
- Business Process
- Online Shop
- Business Process Modelling Notation
- Compositional Development
- Composition Operation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Dahl, O.J., Dijkstra, E.W., Hoare, C.A.R.: Structured programming. Academic Press Ltd. (1972)
Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in BPMN. In: Information and Software Technology (2008)
Eshuis, R., Fokkinga, M.M.: Comparing refinements for failure and bisimulation semantics. Fundamenta Informaticae 52(4)
Formal Systems (Europe) Ltd. Failures-Divergences Refinement, FDR2 User Manual (1998), http://www.fsel.com
Istoan, P.: Defining Composition Operators for BPMN. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 7306, Springer, Heidelberg (2012)
Mendoza, L.E., Capel, M.I.: Automatic Compositional Verification of Business Processes. In: Tse-Yun, F. (ed.) Parallel Processing. LNBIP, vol. 24, Springer, Heidelberg (2009)
Morales, L.E.M., Tuñón, M.I.C., Pérez, M.: A Formalization Proposal of Timed BPMN for Compositional Verification of Business Processes. In: Ng, E.W., Ehrig, H., Rozenberg, G. (eds.) Graph-Grammars and Their Application to Computer Science and Biology. LNBIP, vol. 73, Springer, Heidelberg (2011)
O.: Business Process Modeling Notation, V1.1, Available Specification (Feb. 2008), http://www.bpmn.org
Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut fur instrumentelle Mathematik, Bonn (1962)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)
Wong, P.Y.H.: Formalisations and Applications of Business Process Modelling Notation. DPhil thesis, University of Oxford (2011), Available at http://ora.ox.ac.uk/objects/uuid:51f0aabc-d27a-4b56-b653-b0b23d75959c
Wong, P.Y.H., Gibbons, J.: A Process Semantics for BPMN. In: Liu, S., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 355–374. Springer, Heidelberg (2008)
Wong, P.Y.H., Gibbons, J.: Property Specifications for Workflow Modelling. Science of Computer Programming 76(10) (October 2011)
Woodcock, J.C.P., Davies, J.: Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1996)
Yeung, W.L.: Mapping WS-CDL and BPEL into CSP for Behavioural Specification and Verification of Web Services. In: Proceedings of 4th European Conference on Web Services (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wong, P.Y.H. (2013). Compositional Development of BPMN. In: Binder, W., Bodden, E., Löwe, W. (eds) Software Composition. SC 2013. Lecture Notes in Computer Science, vol 8088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39614-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-39614-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39613-7
Online ISBN: 978-3-642-39614-4
eBook Packages: Computer ScienceComputer Science (R0)