J4 ›› 2014, Vol. 41 ›› Issue (3): 169-173.doi: 10.3969/j.issn.1001-2400.2014.03.025

• 研究论文 • 上一篇    下一篇

S3PR网可达标识数的一种有效估算方法

洪良   

  1. (西安电子科技大学 机电工程学院,陕西 西安  710071)
  • 收稿日期:2013-01-31 出版日期:2014-06-20 发布日期:2014-07-10
  • 通讯作者: 洪良
  • 作者简介:洪良(1984-),男,博士,E-mail: hongliang20030605@163.com.
  • 基金资助:

    国家自然科学基金资助项目(61074035);中央高校基本科研业务费资助项目(JY10000904001);教育部高等学校博士点基金资助项目(20090203110009)

On efficient estimation of reachable markings for S3PR

HONG Liang   

  1. (School of Mechano-electronic Engineering, Xidian Univ., Xi'an  710071, China)
  • Received:2013-01-31 Online:2014-06-20 Published:2014-07-10
  • Contact: HONG Liang

摘要:

提出一种近似计算S3PR网可达标识数的代数方法.首先,基于组合学,可以找到一个S3PR网可达标识数的上限;然后,通过计算包含两个资源库所的信标,找到大部分甚至全部不可达标识的数量.这样,可达标识数上限减去不可达标识的数量就是估算的可达标识数.

关键词: 柔性制造系统, Petri网, 信标, 可达标识

Abstract:

This paper proposes a method that deals with an approximate calculation of the number of reachable markings of an S3PR in an algebraic way. Based on combinatorics, we find an upper bound of reachable markings of an S3PR. Then we try to find the number of unreachable markings by extracting siphons with two resource places. The obtained number covers most or even all of the unreachable markings. Finally, we can estimate the number of reachable markings by removing the unreachable ones from the upper bound. Calculations and analyses verify the effectiveness of the proposed method.

Key words: flexible manufacturing system, Petri net, siphon, reachable marking