A Hierarchical Timed Coloured Petri Nets for BPMN-based Process Analysis

Abstract

Although many business process models have been proposed, most of them do not contain all the arguments of control, message and data flows, defined in BPMN. They do not concern time conditions as in BPMN. On the other hand, these features allow a process to be defined with richer semantics but increase the difficulty of correcting an error or inaccurate process at workflow design. To simplify the analysis, we defined Hierarchical Timed Coloured Petri Nets (H-C(T) PNets), which is extended from Coloured Petri Nets (CPNets) and adopted the analysis techniques in CPNets and Timed PNets (TPNets). Finally, a comparison among H-C(T) PNets, PNets, CPNets and TPNets is given.