SYNTHESIS OF A CLASS OF DEADLOCK-FREE PETRI NETS

被引：28

作者：

DATTA, A ^{[1
]}

GHOSH, S ^{[1
]}

机构：

[1] JADAVPUR UNIV,CTR COMP,CALCUTTA 700032,W BENGAL,INDIA

来源：

JOURNAL OF THE ACM | 1984年 / 31卷 / 03期

关键词：

COMPUTER NETWORKS;

D O I：

10.1145/828.322441

中图分类号：

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

学科分类号：

0812 ;

摘要：

A new class of Petri nets called regular nets is described. The structure of these nets guarantees liveness once the invariants are marked with tokens. Some graphical properties of invariants and variants are discussed. The concept of net labeling is introduced and a systematic method of synthesizing regular nets is presented. It is shown how the safety of such nets can be trivially assured, thus producing live and safe control structures.

引用

页码：486 / 506

页数：21