A Hierarchical Timed Coloured Petri Nets for BPMN-based process analysis

Ching Huey Wang, Pei Shu Huang, Feng-Jian Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 T c PNets), which is extended from Coloured Petri Nets (CPNets) and adopted the analysis techniques in CPNets and Timed PNets (TPNets). Finally, a comparison among HT c PNets, PNets, CPNets and TPNets is given.

Original languageEnglish
Title of host publicationSEKE 2010 - Proceedings of the 22nd International Conference on Software Engineering and Knowledge Engineering
Pages417-420
Number of pages4
StatePublished - 1 Dec 2010
Event22nd International Conference on Software Engineering and Knowledge Engineering, SEKE 2010 - Redwood City, CA, United States
Duration: 1 Jul 20103 Jul 2010

Publication series

NameSEKE 2010 - Proceedings of the 22nd International Conference on Software Engineering and Knowledge Engineering

Conference

Conference22nd International Conference on Software Engineering and Knowledge Engineering, SEKE 2010
CountryUnited States
CityRedwood City, CA
Period1/07/103/07/10

Keywords

  • BPMN
  • Business process
  • CPNets
  • Control flow
  • Data flow
  • Timed PNets

Fingerprint Dive into the research topics of 'A Hierarchical Timed Coloured Petri Nets for BPMN-based process analysis'. Together they form a unique fingerprint.

Cite this