Some Results on Petri Net Languages

Stéphane Lafortune, Hyuck Yoo

Research output: Contribution to journalArticle

7 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 languageEnglish
Pages (from-to)482-485
Number of pages4
JournalIEEE Transactions on Automatic Control
Volume35
Issue number4
DOIs
Publication statusPublished - 1990 Apr

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Some Results on Petri Net Languages'. Together they form a unique fingerprint.

  • Cite this