DocumentCode
710542
Title
Closed form formula construction to enumerate control related states of Bottom Left k-net S3PR system (with a Bottom Left side non-sharing resource place) of Petri nets
Author
Chao, Daniel Yuh ; Tsung Hsien Yu
Author_Institution
Dept. of Manage. & Inf. Sci., Nat. Cheng Chi Univ., Taipei, Taiwan
fYear
2015
fDate
9-11 April 2015
Firstpage
480
Lastpage
485
Abstract
Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and k-th order system which is the simplest class of S3PR (Systems of Simple Sequential Processes with Resources). This paper progresses one step further on enumerating reachable (forbidden, live, and deadlock) states for Bottom Left k-net systems (one non-sharing resource place in the Bottom position of the right-side process, below denoted as Bottom-Left-k-net) with a formula depending on parameter k for a subclass of nets with k sharing resources.
Keywords
Petri nets; reachability analysis; MG; Petri nets; bottom left-side nonsharing resource place; bottom position; bottom-left k-net S3PR system; closed form formula construction; control related states enumeration; deadlock statev; forbidden state; k-sharing resources; k-th order system; live state; marked graphs; reachable states; right-side process; systems-of-simple sequential processes-with-resources; Analytical models; Chaos; Closed-form solutions; Flexible manufacturing systems; Petri nets; Reachability analysis; System recovery; Control systems; Petri nets; discrete event systems; flexible manufacturing systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, Sensing and Control (ICNSC), 2015 IEEE 12th International Conference on
Conference_Location
Taipei
Type
conf
DOI
10.1109/ICNSC.2015.7116084
Filename
7116084
Link To Document