On reachability graphs of Petri nets

被引：33

作者：

Ye, XM

Zhou, HT

Song, XY

机构：

[1] Portland State Univ, Dept ECE, Portland, OR 97207 USA

[2] Inner Mongolia Univ, Coll Comp Sci, Hohhot 010021, Peoples R China

来源：

COMPUTERS & ELECTRICAL ENGINEERING | 2003年 / 29卷 / 02期

关键词：

Petri net; reachability tree; reachability graph; safeness; boundedness; conservation; liveness; reachability; coverability;

D O I：

10.1016/S0045-7906(01)00034-9

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：263 / 272

页数：10

共 7 条

[1] Condensed state spaces for symmetrical coloured Petri nets [J].