SOME RESULTS ON PETRI NET LANGUAGES

被引：6

作者：

LAFORTUNE, S

YOO, H

机构：

[1] Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1990年 / 35卷 / 04期

关键词：

D O I：

10.1109/9.52310

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We compare various classes of Petri net languages. We present a new constructive proof of the equivalence, from the point of view of descriptive power, of “general” Petri nets and “restricted” Petri nets (no multiple arcs nor self-loops are allowed in the latter class). We also comment on the descriptive power of Petri nets versus that of finitely recursive processes. © 1990 IEEE

引用

页码：482 / 485

页数：4

共 8 条

[1]

DREES S, 1987, ADV PETRI NETS 1987, P309

[2]

HACK M, 1976, MITLCSTM159 LAB COMP

[3]

Hoare C.A.R., 1985, COMMUNICATING SEQUEN

[4]

HOLLOWAY LE, IN PRESS IEEE T AUTO

[5] FINITELY RECURSIVE PROCESS MODELS FOR DISCRETE EVENT SYSTEMS [J].

INAN, K ;

VARAIYA, P .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1988, 33 (07) :626-639

[6]

KROGH BH, 1987, 25TH P ALL C

[7]

Peterson J. L., 1981, PETRI NET THEORY MOD

[8] THE CONTROL OF DISCRETE EVENT SYSTEMS [J].

RAMADGE, PJG ;

WONHAM, WM .

PROCEEDINGS OF THE IEEE, 1989, 77 (01) :81-98

← 1 →