Workflow Research And Application About Time Verification

There are some optional activities and alternative paths. Deadline will easily satisfy by utilizing them. When the workflow works, people focus on status which will be reached or and the deadline. The main methods of modeling are workflow graph and petri net. When there are many nodes, status eruption may happen.In order to estimate the latest finishing time of an activity node, a temporal model based on workflow graph is introduced. Then we propose four kinds of critical paths, which are used to verify the deadline of the workflow. By the method, we don't need to calculate the deadlines of all the activities, but only to calculate some of them, according to the facts. The method reduces calculation, and improves the execution efficiency of workflow.The deadline of activity and reachability verification have been recognized as one of the most significant time limitations of today's workflows. In this paper, a new temporal model , hierarchically timed petri net (HTPN), is proposed through incorporating the deadline constraints into TPN. We present rules to fetch structures hierarchically. While TPN is converted to HTPN, physical reachability is verified. An algorithm of hierarchically timed tree is put forward. Then, the method of verifying the timing reachability is given. We demonstrate the application of our method with an example.On the foundations of theoretical research, we have developed a workflow management system. This system is Flex Work based on the B/S three layers structure. In some distance, this system has performed the productions of the theoretical research.