A Relative Timed Semantics for BPMN
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-determini...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
2008
|
| _version_ | 1826268117810020352 |
|---|---|
| author | Wong, P Gibbons, J |
| author_facet | Wong, P Gibbons, J |
| author_sort | Wong, P |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T21:04:41Z |
| format | Conference item |
| id | oxford-uuid:3c0ac353-029f-4e5d-943b-b122be6ffdcd |
| institution | University of Oxford |
| last_indexed | 2024-03-06T21:04:41Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | oxford-uuid:3c0ac353-029f-4e5d-943b-b122be6ffdcd2022-03-26T14:11:13ZA Relative Timed Semantics for BPMNConference itemhttp://purl.org/coar/resource_type/c_5794uuid:3c0ac353-029f-4e5d-943b-b122be6ffdcdDepartment of Computer Science2008Wong, PGibbons, JWe 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. |
| spellingShingle | Wong, P Gibbons, J A Relative Timed Semantics for BPMN |
| title | A Relative Timed Semantics for BPMN |
| title_full | A Relative Timed Semantics for BPMN |
| title_fullStr | A Relative Timed Semantics for BPMN |
| title_full_unstemmed | A Relative Timed Semantics for BPMN |
| title_short | A Relative Timed Semantics for BPMN |
| title_sort | relative timed semantics for bpmn |
| work_keys_str_mv | AT wongp arelativetimedsemanticsforbpmn AT gibbonsj arelativetimedsemanticsforbpmn AT wongp relativetimedsemanticsforbpmn AT gibbonsj relativetimedsemanticsforbpmn |