By Topic

Optimization of consuming resource problem based on reachability graph of petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhang Bo ; Sch. of Autom., Beijing Inst. of Technol., Beijing, China ; Qu Yizhi ; Ma Tao ; Li Peng

The problem of resource optimization is one of the most important issues in discrete event systems (DES). Assuming that the firing of transition consumes the resource of DES but the place does not, an improved consuming Petri net (ICPN) is proposed to deal with this problem by associating a consuming function with each transition. In order to describe this process and obtain the minimal consuming function, transitions are divided into two subsets TP (with a positive real number) and TZ (with a zero number). Based on the reachability graph (RG), an optimal algorithm is presented to compute the optimal resources and the corresponding firing count vector, and an example is also provided to illustrate the validity and efficiency.

Published in:

Control Conference (CCC), 2011 30th Chinese

Date of Conference:

22-24 July 2011