Please use this identifier to cite or link to this item:

Title: Enumeration of reachable, forbidden, live states of gen-left k-net system (with a non-sharing resource place) of Petri Nets
Authors: 趙玉
Chao, Daniel Yuh
Yu, Tsung Hsien
Contributors: 資管系
Keywords: Artificial intelligence;Artificial intelligence;Computation theory;Control systems;Flexible manufacturing systems;Graph theory;Manufacture;Petri nets;Closed form solutions;Closed form solutions;Large-scale optimization;Large-scale optimization;Marked graphs;Marked graphs;Net systems;Net systems;Order systems;Order systems;Sequential process;Sequential process;Sharing resources;Sharing resources;Side process;Side process;Discrete event simulation
Date: 2015-01
Issue Date: 2017-08-09 17:28:16 (UTC+8)
Abstract: Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and kth 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 general k-net systems (one non-sharing resource place in the general position of the Left-side process) with a formula depending on parameter k for a subclass of nets with k sharing resources. The results are also verified by Top-Left-k-net, Bottom-Left-k-net and Middle-Left-k-net system. © 2014 IEEE.
Relation: IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CICA 2014: 2014 IEEE Symposium on Computational Intelligence in Control and Automation, Proceedings,
Data Type: conference
DOI 連結:
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

File Description SizeFormat

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing