计算机工程与应用2016，Vol.52Issue(12)：26-30,5.DOI:10.3778/j.issn.1002-8331.1511-0313
时间约束工作流的可调度性分析
Schedulability analysis of timing constraint workflows
摘要
Abstract
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.关键词
工作流/时间约束/可调度性分析Key words
workflow/timing constraint/schedulability analysis分类
信息技术与安全科学引用本文复制引用
冯复剑..时间约束工作流的可调度性分析[J].计算机工程与应用,2016,52(12):26-30,5.
