English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27228/39071
Visitors : 2407488      Online Users : 69
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51163

Title: Augmented Reachability Trees for 1-Place-Unbounded Generalized Petri Nets
Authors: Mu Der Jeng
Mao Yu Peng
Contributors: 國立臺灣海洋大學電機工程學系
Date: 1999-03
Issue Date: 2018-11-15T01:05:43Z
Publisher: IEEE Transactions on Systems, Man, and Cybernetics - Part A
Abstract: Abstract: An augmented reachability tree (ART) is proposed to extend the capability of the classical reachability tree (RT) for analyzing qualitative properties, such as liveness, of a class of unbounded generalized Petri nets, called 1-place-unbounded nets, where there is at most one unbounded place for each net. The idea is based on the computation of the minimal marking of each node in the tree. An algorithm for obtaining the minimal marking is shown. Examples are given to illustrate the technique. In addition to liveness, the proposed method can verify other properties such as reversibility and feasible firing sequences. Furthermore, properties verifiable by RT are also verifiable by ART.
Relation: 29(2) pp.173-183
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51163
Appears in Collections:[電機工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML25View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback