A Relative Timed Semantics for BPMN
Peter Wong and Jeremy Gibbons
Abstract
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. By using CSP as the semantic domain, we exploit its refinement to show some properties relating the timed semantics and BPMN's untimed process semantics. Our timed semantics allows behavioural properties of BPMN diagrams to be mechanically verified via automatic model-checking provided by the FDR tool.
Details
| Address |
Zurich |
| Book Title |
Foundations of Coordination Languages and Software Architectures (FOCLASA) |
| Month |
July |
| Year |
2008 |
Links
Related pages
|
People |