• DocumentCode
    2262830
  • Title

    Deterministic λ-free Petri net languages and their application to the supervisory control of discrete event dynamic systems

  • Author

    Sreenivas, Ramavarapu S.

  • Author_Institution
    Dept. of Gen. Eng., Illinois Univ., Urbana, IL, USA
  • fYear
    1993
  • fDate
    16-18 Aug 1993
  • Firstpage
    340
  • Abstract
    In this paper we introduce a family of languages called deterministic λ-free Petri net languages (DPNLs). We show that the controllability of a DPNL K⊆Σ* with respect to a DPNL L⊆Σ* is decidable. That is, it is possible to decide if (i) K⊆L, and (ii) KΣu∩L⊆K, where Σ=Σu∪Σc and Σu ∩Σc=φ. We also show that this family of languages strictly includes the family of Free-labeled Petri net languages (FLPNLs), another family of languages where the controllability of one language with respect to another is decidable
  • Keywords
    Petri nets; controllability; discrete event systems; formal languages; Petri net languages; controllability; deterministic λ-free languages; discrete event dynamic systems; free-labeled languages; supervisory control; Books; Controllability; Equations; Fires; Mechanical factors; Petri nets; Power system modeling; Supervisory control; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
  • Conference_Location
    Detroit, MI
  • Print_ISBN
    0-7803-1760-2
  • Type

    conf

  • DOI
    10.1109/MWSCAS.1993.343040
  • Filename
    343040
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2262830