CASIA OpenIR  > 09年以前成果
A modified reachability tree approach to analysis of unbounded Petri nets
Wang, FY; Gao, YQ; Zhou, MC
Source PublicationIEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
2004-02-01
Volume34Issue:1Pages:303-308
SubtypeArticle
AbstractReachability trees, especially the corresponding Karp-Miller's finite reachability trees generated for Petri nets are fundamental for systematically investigating many characteristics such as boundedness, liveness, and performance of systems modeled by Petri nets. However, too much information is lost in a FRT to render it useful for many applications. In this paper, modified reachability trees (MRT) of Petri nets are introduced that extend the capability of Karp-Miller's FRTs in solving the liveness, deadlock, and reachability problems, and in defining or determining possible firing sequences. The finiteness of MRT is proved and several examples are presented to illustrate the advantages of MRT over FRT.
KeywordAnalysis Method Discrete Event Systems Petri Nets Reachability Tree
WOS HeadingsScience & Technology ; Technology
Indexed BySCI
Language英语
WOS Research AreaAutomation & Control Systems ; Computer Science
WOS SubjectAutomation & Control Systems ; Computer Science, Artificial Intelligence ; Computer Science, Cybernetics
WOS IDWOS:000188464600028
Citation statistics
Cited Times:31[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.ia.ac.cn/handle/173211/9036
Collection09年以前成果
Corresponding AuthorWang, FY
Affiliation1.Chinese Acad Sci, Inst Automat, Complex Syst & Intelligence Sci Lab, Beijing 100080, Peoples R China
2.Univ Arizona, Program Adv Res Complex Syst, Dept Syst & Ind Engn, Tucson, AZ 85721 USA
3.New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
Recommended Citation
GB/T 7714
Wang, FY,Gao, YQ,Zhou, MC. A modified reachability tree approach to analysis of unbounded Petri nets[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS,2004,34(1):303-308.
APA Wang, FY,Gao, YQ,&Zhou, MC.(2004).A modified reachability tree approach to analysis of unbounded Petri nets.IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS,34(1),303-308.
MLA Wang, FY,et al."A modified reachability tree approach to analysis of unbounded Petri nets".IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 34.1(2004):303-308.
Files in This Item: Download All
File Name/Size DocType Version Access License
A Modified Reachabil(184KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang, FY]'s Articles
[Gao, YQ]'s Articles
[Zhou, MC]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang, FY]'s Articles
[Gao, YQ]'s Articles
[Zhou, MC]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang, FY]'s Articles
[Gao, YQ]'s Articles
[Zhou, MC]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: A Modified Reachability Tree Approach to Analysis of Unbounded Petri Nets.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.