时间约束层次细化工作流建模及验证研究.pdfVIP

计算机集成制造系统 Vo 1. 12 No. 11 第 12 卷第 11 期 20 0 6 年 11 月 Computer Integrated Manufacturing Systems Nov. 2006 文革E编号: 1006-5911(2006) 11-1773-06 时间约束层次细化工作流建模及验证研究 钟诗胜，汤新民，李涛 (哈尔滨工业大学机电工程学院，黑龙江 哈尔滨 150001) 摘 要:为降低工作流建模和验证的复杂度，提出了一种自顶向下题步细化的建模与验证方法。首先，引入了 层次细化工作流网，实现提杂工作流建模，将满足可靠性的子闷，替换顶层结构中输入库所安全的子网变迁，使细 化盾的工作流模型自动地满足可靠性要求。为验证可洞庭性，提出了时间约束屡次细化工作流网，给出子网与子 网变迁之间的时间约束等价变换原则，可保持细化前后工作流网可调度性不变的充分条件。依此条件，分别给出了 串行、并行、选择、循环 4 种基本组件的压缩推理规则，并在线性复杂腹内解决了层次细化工作流网时间验证问题@ 关键词:工作流验证:层次细化工作流网$时间约束 Petri 网 中图分类号:TP391. 9 文献标识码:A Modeling and verification of timing constraint hierarchical refinement workflow Z HONG Shi - sheng. TANG X in … min.LI Tao (Sch. of Mechatronics Eng. • Harbin Inst. of Tech. • Harbin 150001. China) Abstract: 丁o reduce the modeling and verification complexity in complicated workflow. a top - down refinement method for modeling and verification was proposed. Firstly , the Hierarchical Refinement Workflow net (HRWF … net) was introduced to design complicated workflow in the framework of Petri nets. Those transitions whose input places were safe should be refined by sub nets satisfying reliabi1ity to guarantee soundness of resulting workflow net. Furthermore , to verify schedulability in the hierarchical refinement workflow , Time Constraint Hierarchical Refinement Workflow net (TCHRWF-net) was present时， and the range of tokerís arrival time of the sink place in the suh net was calculated. If the range of tokerís arrival time equals to that of output place of the transition in the top workflow net refined by the sub net