Simplification analysis and schedulability verification of timing constraint workflow model

To describe time modeling in a complex workflow system and verify the time schedulability, a method of applying simplification rules to Petri nets was put forward. Firstly, some concepts of Timing Constraints Petri Nets (TCPN) and methods of workflow modeling based on TCPN were presented to model workflow including its temporal information. Secondly, to conduct schedulability verification and analysis in a workflow net, the definition of time schedulability of TCPN was given, and according to equivalent transformation principles of time constraint, the simplification rules for the four elementary workflow components based on TCPN and their compression reasoning methods were proposed. The methods could be used to simplify complex workflow model, as well as calculate the node time parameters of workflow model so as to realize time modeling and schedulability analysis of workflow structure or process with time information. Finally, taking insurance claim as an example, the feasibility of the proposed method was verified.