• DocumentCode
    1363169
  • Title

    Some results on Petri net languages

  • Author

    Lafortune, Stephane ; Yoo, Hyuck

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
  • Volume
    35
  • Issue
    4
  • fYear
    1990
  • fDate
    4/1/1990 12:00:00 AM
  • Firstpage
    482
  • Lastpage
    485
  • 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 of self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed
  • Keywords
    Petri nets; formal languages; Petri net languages; descriptive power; formal languages; recursive processes; Bipartite graph; Computer hacking; Control system analysis; Control theory; Discrete event systems; Fiber reinforced plastics; Formal languages; Labeling; Petri nets; Terminology;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.52310
  • Filename
    52310
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1363169