期刊文献+

时间约束层次细化工作流建模及验证研究 被引量:3

Modeling and verification of timing constraint hierarchical refinement workflow
下载PDF
导出
摘要 为降低工作流建模和验证的复杂度,提出了一种自顶向下逐步细化的建模与验证方法。首先,引入了层次细化工作流网,实现复杂工作流建模,将满足可靠性的子网,替换顶层结构中输入库所安全的子网变迁,使细化后的工作流模型自动地满足可靠性要求。为验证可调度性,提出了时间约束层次细化工作流网,给出子网与子网变迁之间的时间约束等价变换原则,可保持细化前后工作流网可调度性不变的充分条件。依此条件,分别给出了串行、并行、选择、循环4种基本组件的压缩推理规则,并在线性复杂度内解决了层次细化工作流网时间验证问题。 To 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 reliability 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 presented, and the range of token's arrival time of the sink place in the sub net was calculated. If the range of token's arrival time equals to that of output place of the transition in the top workflow net refined by the sub net, schedulability of resulting workflow remained unchanged. According to the conclusion, a set of transform rules for four elementary workflow components were proposed, which could realize the time constraint verification of TCHRWF-net within linear time complexity.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2006年第11期1773-1778,1806,共7页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(60373102)。~~
关键词 工作流验证 层次细化工作流网 时间约束PETRI网 workflow verification hierarchical refinement workflow net time constraint Petri nets
  • 相关文献

参考文献7

二级参考文献63

  • 1[1]W M P van der Aalst.The application of Petri nets to workflow management [J].Journal of Circuits,Systems,and Computers,1998,8(1):21-66.
  • 2[2]W M P van der Aalst.Chapter 10;Three Good reasons for Using a Petri-net-based Workflow Management System.In T.WaKaYaMa et al.,editor,Information and Process Integration in Enterprises;Rethinking documents [M].The Kluwer International Series in Engineering and Computer Science,Kluwer Academic Publishers,Norwell,1998:161-182.
  • 3[3]C A Ellis,K Keddara,G Rozenberg.Dynamic change within workflow systems [J].In N.Comstock and C.Ellis,editors,Conf.on Organizational Computing Systems,ACM,SIGOIS,Milpitas,CA(1995):10-21.
  • 4[4]W M P van der Aalst.Verification of workflow tast structures [A].Information Systems,2000,25(1):43-69.
  • 5[5]Zaidi A K.On temporal logic programming using Petri nets [J].IEEE Transactions on Systems,Man and Cybernetics,May 1999,29(3):245-254.
  • 6[6]Yao Y.A Petri net model for temporal knowledge representation and reasoning [J].IEEE Trans.Systems,Man,and Cybernetics,1994,24(9):1374-1382.
  • 7[7]Lin C,Chanson S T.Logical inference of clauses based on Petri net models [J].International Journal of Intelligent Systems,John Wiley & Sons,August 1998,13:821-840.
  • 8[8]Lin C,Chaudhury A,Whinston A B,Marinescu D C.Logical inference of Horn clauses in Petri net models [J].IEEE Trans.on Knowledge and Data Engineering,June 1993,5(4):416-425.
  • 9T. Murata. Petri nets: Properties, analysis and applications.Proceedings of the IEEE, 1989, 77(4) : 541-580.
  • 10W. Sadiq, M. Orlowska. Applying graph reduction techniques for identifying structural conflicts in process models. In: Proc. of the 11th Int'l Conf. on Advanced Information Systems Engineering(CAiSE'99). Berlin: Springer Verlag, 1999. 195-209.

共引文献78

同被引文献34

引证文献3

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部