On reachability graphs of Petri nets |
| |
| Authors: | Xinming YeJiantao Zhou Xiaoyu Song |
| |
| Affiliation: | a College of Computer Science, Inner Mongolia University, Hohhot 010021, China
b Department of ECE, Portland State University, P.O. Box 751, Portland, OR 97207-0751, USA |
| |
| 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. |
| |
| Keywords: | Petri net Reachability tree Reachability graph Safeness Boundedness Conservation Liveness Reachability Coverability |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
