作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (1): 79-81. doi: 10.3969/j.issn.1000-3428.2009.01.026

• 软件技术与数据库 • 上一篇    下一篇

价格着色Petri网的最小成本可达问题

张 伟,刘 峰   

  1. (江南大学信息工程学院,无锡 214122)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-01-05 发布日期:2009-01-05

Minimum Cost Reachability Problem of Price Coloured Petri Net

ZHANG Wei, LIU Feng   

  1. (School of Information Technology, Jiangnan University, Wuxi 214122)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-01-05 Published:2009-01-05

摘要: 针对实际业务流程建模中成本预算分析的需要,在着色网的基础上扩展价格信息,提出价格着色网。讨论价格着色网的变迁步规则,根据提出的经济标识,给出最小成本构造算法,以一个业务流程实例演示该模型的应用,证明其能够较好地解决业务流程建模中的成本预算分析问题。

关键词: 价格着色Petri网, 最小成本构造算法, 业务流程管理, 成本预算分析

Abstract: This paper proposes Price Coloured Petri Net(PCPN), which is a kind of Coloured Petri Net(CPN) extended with price information to meet the demand of costs and budget analysis in the business process modeling. The transition step rule of PCPN is defined, and the minimum costs generation algorithm is introduced. A business process case is demonstrated how to apply the model. The conclusion is that PCPN does well in solving the costs and budget analysis problem in the business process modeling.

Key words: Price Coloured Petri Net(PCPN), minimum cost generation algorithm, business process management, cost and budget analysis

中图分类号: