Checking system boundedness using ordinary differential equations

  • Authors:

  • Zuohua Ding;Hui Shen;Qi-Wei Ge

  • Affiliations:

  • Center of Math Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, PR China and National Institute for Systems Test and Productivity, University of South Florida, Ta ...;Center of Math Computing and Software Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, PR China;Faculty of Education, Yamaguchi University, 1677-1 Yoshida, Yamaguchi 753-8513, Japan

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

Boundedness is one of the most important properties of discrete Petri nets. Determining the boundedness of a Petri net is usually done through building coverability graph or coverability tree. However, the computation is infeasible for complex applications because the size of the coverability graph may increase faster than any primitive recursive functions. This paper proposes a new technique to check the boundedness without causing this problem. Let a concurrent system be represented by a (discrete) Petri net. By relaxing the (discrete) Petri net to a continuous Petri net, we can model the concurrent system by a family of ordinary differential equations. It has been shown that the boundedness of the discrete Petri net is equivalent to the boundedness of the solutions of the corresponding ordinary differential equations. Hence, we can check the boundedness of a (discrete) Petri net by analyzing the solutions of a family of ordinary differential equations. A case study demonstrates the benefits of our technique.