• DocumentCode
    1482074
  • Title

    Deterministic weak-and-marked Petri net languages are regular

  • Author

    Gaubert, Stéphane ; Giua, Alessandro

  • Author_Institution
    Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
  • Volume
    41
  • Issue
    12
  • fYear
    1996
  • fDate
    12/1/1996 12:00:00 AM
  • Firstpage
    1802
  • Lastpage
    1803
  • Abstract
    The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages
  • Keywords
    Petri nets; formal languages; deterministic marked Petri net language; deterministic weak Petri net language; regular languages; Controllability; Discrete event systems; Linear matrix inequalities; Notice of Violation; Petri nets; Riccati equations; Sparse matrices; Supervisory control; Testing; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.545718
  • Filename
    545718
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1482074