时间约束工作流的可调度性分析

Schedulability analysis of timing constraint workflows

提出一种时间约束工作流的可调度性分析方法。针对时间约束Petri网(Timing Constraint Petri Nets,TCPN)为普通Petri网无法建模多参与资源的不足,给出了扩展的时间约束Petri网(w-TCPN)的定义;结合w-TCPN的拓扑结构,从模型和实例两个层次,给出了w-TCPN变迁可调度的判定定理;提出了时间约束的调整策略。w-TCPN的研究使得时间约束工作流的建模和可调度性分析更加合理。

A schedulability analysis approach of timing constraint workflows is proposed. According to the deficiency of Timing Constraint Petri Nets(TCPN for short)which is ordinary Petri net that can’t be used to model multiple resources, extended Timing Constraint Petri Nets(w-TCPN for short) is defined. Then, based on the topological structure of w-TCPN, from the two levels of model and case, the verification method for the schedulability of w-TCPN is presented in the form of theorems. In the end, the adjustment strategy of timing constraint is proposed. The research of w-TCPN makes the modeling and schedulability analysis of timing constraint workflows more reasonable.