Some Results on Petri Net Languages

Stéphane Lafortune; Hyuck Yoo

doi:10.1109/9.52310

Some Results on Petri Net Languages

Stéphane Lafortune, Hyuck Yoo

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	482-485
Number of pages	4
Journal	IEEE Transactions on Automatic Control
Volume	35
Issue number	4
DOIs	https://doi.org/10.1109/9.52310
Publication status	Published - 1990 Apr
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/9.52310

Cite this

@article{1e68ea7faf4a4f0997a37fcb1bac7502,

title = "Some Results on Petri Net Languages",

abstract = "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.",

author = "St{\'e}phane Lafortune and Hyuck Yoo",

year = "1990",

month = apr,

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, Stéphane

AU - Yoo, Hyuck

PY - 1990/4

Y1 - 1990/4

N2 - 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.

AB - 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.

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

U2 - 10.1109/9.52310

DO - 10.1109/9.52310

M3 - Article

AN - SCOPUS:0025419116

SN - 0018-9286

VL - 35

SP - 482

EP - 485

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 4

ER -

Some Results on Petri Net Languages

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this