Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2018, Vol. 44 ›› Issue (5): 60-65,77. doi: 10.19678/j.issn.1000-3428.0046855

Previous Articles     Next Articles

Time Constraint Verification and Optimal Path Analysis of Mission Critical System

CHEN Ying 1,SUN Xiaobo 1,XING Jianchun 1,YANG Qiliang 1,2   

  1. 1.College of Defense Engineering,PLA University of Science and Technology,Nanjing 210007,China; 2.State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093,China
  • Received:2017-04-18 Online:2018-05-15 Published:2018-05-15

任务关键系统的时间约束验证与最优路径分析

陈莹 1,孙晓波 1,邢建春 1,杨启亮1,2   

  1. 1.解放军理工大学 国防工程学院,南京 210007; 2.南京大学 计算机软件新技术国家重点实验室,南京 210093
  • 作者简介:陈莹(1991—),女,硕士研究生,主研方向为任务关键系统建模与分析;孙晓波,硕士研究生;邢建春,教授、博士生导师;杨启亮,副教授。
  • 基金资助:
    国家自然科学基金“基于声表面波的埋入式钢筋锈蚀传感器研究”(51505499);江苏省自然科学基金“面向开放环境的软件模糊自适应运行机理与构造方法”(BK20151451)。

Abstract: Time verification is inadequate in workflows of Mission Critical System(MCS).To solve this problem,a new workflow modeling and time verification approach is proposed.Firstly,this approach divides the system tasks into mission critical ones and non-mission critical ones based on Place Containing the Time factor colored Petri-Workflow Net(PCTP-WFN),this can manage the activities which cannot meet the time constraint,and can execute non-mission critical tasks as many as possible on the premise of finishing the final tasks,which can thereby eliminate much wasted time in the MCS.Secondly,this approach transforms the time constraint of workflow activities into mathematical constraint,then uses MATLAB to analyze the models,and gets the optimal path finally.The example analysis of the shore-based facility security information system show that,the proposed approach is feasible and practicable.

Key words: Web service composition, Mission Critical System(MCS), time verification, optimal path, Colored Time Petri Net(CTPN)

摘要: 针对任务关键系统工作流中对时间验证不够完善的问题,提出一种新的工作流建模和时间验证方法。基于库所含时间因素的着色时间Petri工作流网,将系统中的任务划分为关键任务和非关键任务,对不满足时间约束的活动进行管理,在完成最终任务的前提下,尽可能多地执行工作流中的非关键任务,从而减少时间资源的浪费。在此基础上,将工作流中活动的时间约束转化为数学约束问题,并运用MATLAB对模型进行分析,最终得出工作流中的最优路径。对军港岸基保障信息系统案例进行分析,结果表明,该方法具有一定的可行性和实用性。

关键词: Web服务组合, 任务关键系统, 时间验证, 最优路径, 着色时间Petri网

CLC Number: