Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0045-7906(01)00034-9 | Computers & Electrical Engineering |
Keywords | Field | DocType |
Petri net,Reachability tree,Reachability graph,Safeness,Boundedness,Conservation,Liveness,Reachability,Coverability | Graph,Structured systems analysis and design method,Petri net,Matrix (mathematics),Computer science,Computer network,Theoretical computer science,Reachability,Stochastic Petri net,Distributed computing,Liveness | Journal |
Volume | Issue | ISSN |
29 | 2 | 0045-7906 |
Citations | PageRank | References |
6 | 0.50 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinming Ye | 1 | 52 | 11.62 |
| Jiantao Zhou | 2 | 580 | 78.87 |
| Xiaoyu Song | 3 | 471 | 51.61 |