A Relative Timed Semantics for BPMN
Peter Y.H. Wong and Jeremy Gibbons
We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion of relative time in the form of delays chosen non-deterministically from a range. We illustrate the application by an example. We also show some properties relating the timed semantics and BPMN's untimed process semantics by exploiting CSP refinement. Our timed semantics allows behavioural properties of BPMN diagrams to be mechanically verified via automatic model-checking as provided by the FDR tool.
Proceedings of 7th International Workshop on the Foundations of Coordination Languages and Software Architectures.
Invited for special issue in Science of Computer Programming. A shorter version of this paper was presented at the 3rd European Young Researchers Workshop on Service Oriented Computing‚ London‚ United Kingdom‚ June 2008. Extended version available at http://web.comlab.ox.ac.uk/oucl/work/peter.wong/pub/bpmntime.pdf.