OXFORD UNIVERSITY COMPUTING LABORATORY

A Relative Timed Semantics for BPMN

Peter Wong (Oxford University)

info

date

15th February 2008 (week 5, Hilary Term 2008)

time

15:30

place

Room 479 of the Wolfson Building

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 earlier untimed process semantics by introducing the notion of relative-time in the form of delays and durations over non-deterministic ranges. By using CSP as the common semantic domain, we show some properties relating the timed and untimed model based on CSP's existing refinement orderings.

further info

related series

Random Image
Random Image
Random Image