计算机科学与探索 ›› 2010, Vol. 4 ›› Issue (6): 542-551.DOI: 10.3778/j.issn.1673-9418.2010.06.006

• 学术研究 • 上一篇    下一篇

规范流网中OR-join任务的语义及使能判定算法

曹国荣+, 谭庆平, 吴 浩, 解金刚   

  1. 国防科学技术大学 计算机学院, 长沙 410073
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-06-18 发布日期:2010-06-18
  • 通讯作者: 曹国荣

Semantics and Implementation of the OR-join in Regular Flow Nets

CAO Guorong+, TAN Qingping, WU Hao, XIE Jingang   

  1. School of Computer Science, National University of Defense Technology, Changsha 410073, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-06-18 Published:2010-06-18
  • Contact: CAO Guorong

摘要: 对规范流网中OR-join任务语义及使能判定算法进行了深入研究。首先介绍YAWL语言中与OR-join任务有关的概念, 规范流网的有关定义, 然后在此基础上定义规范流网关于OR-join任务新的语义; 最后提出一种判定规范流网OR-join任务使能的算法, 并举例说明算法的正确性和有效性。

关键词: OR-join任务, 规范流网, YAWL语言, Petri网

Abstract: The semantics and implementation of the OR-join is examined in detail in the context of regular flow nets (RFNs). Firstly the concepts related to OR-join in yet another workflow language (YAWL), the concepts of RFNs are introduced. Then based on the previous contents, the semantics of RFNs with OR-join are proposed. Finally an implementation towards determining OR-join enablement in RFNs accompanied by an example is illustrated.

Key words: OR-join, regular flow nets (RFNs), yet another workflow language (YAWL), Petri nets

中图分类号: