Residential College | false |
Status | 已發表Published |
On reachability graphs of Petri nets | |
Ye X.2; Zhou J.2; Song X.1 | |
2003-03-01 | |
Source Publication | Computers and Electrical Engineering
![]() |
ISSN | 00457906 |
Volume | 29Issue:2Pages:263-272 |
Abstract | Petri net is a powerful tool for system analysis and design. Several techniques have been developed for the analysis of Petri nets, such as reachability trees, matrix equations and reachability graphs. This article presents a novel approach to constructing a reachability graph, and discusses the application of the reachability graph to Petri nets analysis. © 2003 Elsevier Science Ltd. All rights reserved. |
Keyword | Boundedness Conservation Coverability Liveness Petri Net Reachability Reachability Graph Reachability Tree Safeness |
DOI | 10.1016/S0045-7906(01)00034-9 |
URL | View the original |
Language | 英語English |
WOS ID | WOS:000180077800001 |
Scopus ID | 2-s2.0-0037332904 |
Fulltext Access | |
Citation statistics | |
Document Type | Journal article |
Collection | University of Macau |
Affiliation | 1.Portland State University 2.Inner Mongolia University China |
Recommended Citation GB/T 7714 | Ye X.,Zhou J.,Song X.. On reachability graphs of Petri nets[J]. Computers and Electrical Engineering, 2003, 29(2), 263-272. |
APA | Ye X.., Zhou J.., & Song X. (2003). On reachability graphs of Petri nets. Computers and Electrical Engineering, 29(2), 263-272. |
MLA | Ye X.,et al."On reachability graphs of Petri nets".Computers and Electrical Engineering 29.2(2003):263-272. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment