Deterministic weak-and-marked Petri net languages are regular

被引：3

作者：

Gaubert, S ^{[1
]}

Giua, A ^{[1
]}

机构：

[1] UNIV CAGLIARI, DIPARTIMENTO INGN ELETT & ELETT, I-09123 CAGLIARI, ITALY

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1996年 / 41卷 / 12期

关键词：

D O I：

10.1109/9.545718

中图分类号：

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

学科分类号：

0812 ;

摘要：

The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the das of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.

引用

页码：1802 / 1803

页数：2

共 6 条

[1] VECTOR ADDITION SYSTEMS AND REGULAR LANGUAGES [J].

GINZBURG, A ;

YOELI, M .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (03) :277-284

[2] DECIDABILITY AND CLOSURE-PROPERTIES OF WEAK PETRI-NET LANGUAGES IN SUPERVISORY CONTROL [J].

GIUA, A ;

DICESARE, F .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (05) :906-910

[3]

Hopcroft J. E., 2007, Introduction to Automata Theory, Languages and Computation

[4]

Reutenauer C., 1990, MATH PETRI NETS

[5] A NOTE ON DECIDING THE CONTROLLABILITY OF A LANGUAGE-K WITH RESPECT TO A LANGUAGE-L [J].

SREENIVAS, RS .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993, 38 (04) :658-662

[6] PETRI NETS AND REGULAR LANGUAGES [J].

VALK, R ;

VIDALNAQUET, G .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 23 (03) :299-325

← 1 →