Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/112013


Title: Enumeration of reachable, forbidden, live, and deadlock states of bottom k-th order system (with a left side non-sharing resource place) of Petri nets
Authors: 趙玉
Chao, Daniel Yuh
Yu, Tsung Hsien
Liou, Chia Chang
Contributors: 資訊管理學系
Keywords: reachability analysis;discrete event systems;Petri nets
Date: 2014
Issue Date: 2017-08-17 15:10:02 (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 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 top k-th order systems (one non-sharing resource place in the bottom position of the left-side process, below denoted as Bottom-Left ) with a formula depending on parameter k for a subclass of nets with k sharing resources.
Relation: Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control, ICNSC 2014,572-577
11th IEEE International Conference on Networking, Sensing and Control, ICNSC 2014; Miami, FL; United States; 7 April 2014 到 9 April 2014; 類別編號CFP14NSC-ART; 代碼 105678
Data Type: conference
DOI 連結: http://dx.doi.org/10.1109/ICNSC.2014.6819689
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML229View/Open


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


社群 sharing