中文

Journal of Applied Sciences ›› 2020, Vol. 38 ›› Issue (5): 695-712.doi: 10.3969/j.issn.0255-8297.2020.05.004

• Novel Technologies for Intelligent Computing • Previous Articles     Next Articles

Place Bound Algorithm of Petri Net Based on Partial State Space Storage

LU Weihong1, DING Zhijun2,3   

  1. 1. College of Electricity and Information Engineering, Tongji University, Shanghai 201804, China;
    2. Key Laboratory of the Ministry of Education for Embedded System and Service Computing, Tongji University, Shanghai 201804, China;
    3. Shanghai Electronic Transactions and Information Service Collaborative Innovation Center, Tongji University, Shanghai 201804, China
  • Received:2020-05-25 Online:2020-09-30 Published:2020-10-14

PDF

180

Abstract: Petri net is an important formal modeling tool, and boundedness is one of the important properties of Petri net. In this paper, we focus on this property and propose a new algorithm to solve the place bounds of Petri net without storing all state spaces. The main idea is that in the process of generating state spaces, we can accurately solve the bounds of all places by storing partial states through eliminating some loops of reachability graph and taking advantages of related properties of T-invariant. Experimentally, we compare several other methods with the proposed one in their capability of solving place bounds with the open data set of model checking contest, and results show the effectiveness of the proposed algorithm.

Key words: Petri net, boundedness, state space, bit storage

CLC Number: