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

Bo Zhang; Yizhi Qu; Tao Ma; Peng Li

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

Bo Zhang^*
, Yizhi Qu
, Tao Ma
, Peng Li

^*Corresponding author for this work

Beijing Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

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 T_P (with a positive real number) and T_Z (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.

Original language	English
Title of host publication	Proceedings of the 30th Chinese Control Conference, CCC 2011
Pages	1745-1748
Number of pages	4
Publication status	Published - 2011
Externally published	Yes
Event	30th Chinese Control Conference, CCC 2011 - Yantai, China Duration: 22 Jul 2011 → 24 Jul 2011

Publication series

Name	Proceedings of the 30th Chinese Control Conference, CCC 2011

Conference

Conference	30th Chinese Control Conference, CCC 2011
Country/Territory	China
City	Yantai
Period	22/07/11 → 24/07/11

Keywords

Improved Consuming Petri Net
Optimization
Reachability Graph

Cite this

@inproceedings{11a4bd06ef32455e80ead64164653453,

title = "Optimization of consuming resource problem based on reachability graph of petri nets",

abstract = "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.",

keywords = "Improved Consuming Petri Net, Optimization, Reachability Graph",

author = "Bo Zhang and Yizhi Qu and Tao Ma and Peng Li",

year = "2011",

language = "English",

isbn = "9789881725592",

series = "Proceedings of the 30th Chinese Control Conference, CCC 2011",

pages = "1745--1748",

booktitle = "Proceedings of the 30th Chinese Control Conference, CCC 2011",

note = "30th Chinese Control Conference, CCC 2011 ; Conference date: 22-07-2011 Through 24-07-2011",

}

Optimization of consuming resource problem based on reachability graph of petri nets. / Zhang, Bo; Qu, Yizhi; Ma, Tao et al.
Proceedings of the 30th Chinese Control Conference, CCC 2011. 2011. p. 1745-1748 6000826 (Proceedings of the 30th Chinese Control Conference, CCC 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Zhang, Bo

AU - Qu, Yizhi

AU - Ma, Tao

AU - Li, Peng

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Improved Consuming Petri Net

KW - Optimization

KW - Reachability Graph

UR - https://www.scopus.com/pages/publications/80053059727

M3 - Conference contribution

AN - SCOPUS:80053059727

SN - 9789881725592

T3 - Proceedings of the 30th Chinese Control Conference, CCC 2011

SP - 1745

EP - 1748

BT - Proceedings of the 30th Chinese Control Conference, CCC 2011

T2 - 30th Chinese Control Conference, CCC 2011

Y2 - 22 July 2011 through 24 July 2011

ER -

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

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this