Some results on Petri net languages

Stephane Lafortune, Hyuck Yoo

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs or self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed.

Original languageEnglish
Pages (from-to)482-485
Number of pages4
JournalIEEE Transactions on Automatic Control
Volume35
Issue number4
DOIs
Publication statusPublished - 1990 Apr 1
Externally publishedYes

Fingerprint

Petri nets

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Some results on Petri net languages. / Lafortune, Stephane; Yoo, Hyuck.

In: IEEE Transactions on Automatic Control, Vol. 35, No. 4, 01.04.1990, p. 482-485.

Research output: Contribution to journalArticle

Lafortune, Stephane ; Yoo, Hyuck. / Some results on Petri net languages. In: IEEE Transactions on Automatic Control. 1990 ; Vol. 35, No. 4. pp. 482-485.
@article{1e68ea7faf4a4f0997a37fcb1bac7502,
title = "Some results on Petri net languages",
abstract = "Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs or self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed.",
author = "Stephane Lafortune and Hyuck Yoo",
year = "1990",
month = "4",
day = "1",
doi = "10.1109/9.52310",
language = "English",
volume = "35",
pages = "482--485",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Some results on Petri net languages

AU - Lafortune, Stephane

AU - Yoo, Hyuck

PY - 1990/4/1

Y1 - 1990/4/1

N2 - Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs or self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed.

AB - Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs or self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed.

UR - http://www.scopus.com/inward/record.url?scp=0025419116&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025419116&partnerID=8YFLogxK

U2 - 10.1109/9.52310

DO - 10.1109/9.52310

M3 - Article

AN - SCOPUS:0025419116

VL - 35

SP - 482

EP - 485

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 4

ER -