• DocumentCode
    67443
  • Title

    On a Decidable Class of Partially Controlled Petri Nets With Liveness Enforcing Supervisory Policies

  • Author

    Sreenivas, R.S.

  • Author_Institution
    Dept. of Ind. & Enterprise Syst. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
  • Volume
    43
  • Issue
    5
  • fYear
    2013
  • fDate
    Sept. 2013
  • Firstpage
    1256
  • Lastpage
    1261
  • Abstract
    We identify a class of partially controlled Petri net (PN) structures, which is denoted by G, that strictly includes the class of partially controlled free-choice (FC) PN structures. We show that there is a supervisory policy that enforces liveness in an arbitrary instance N(m0), where N ∈ G, if and only if there is a similar policy for an FCPN that results when the construction procedure enunciated in this paper is executed with N and its controllable transition set as input. Since the existence of a supervisory policy in an arbitrary partially controlled FCPN is decidable, it follows that the existence of similar policies for any N(m0), where N ∈ G, is also decidable. Furthermore, when it exists, the minimally restrictive supervisory policy that enforces in a member of G is characterized by a right-closed set of markings.
  • Keywords
    Petri nets; decidability; PN liveness property; construction procedure; partially controlled Petri nets; partially controlled free-choice PN structure; supervisory policy; Cybernetics; Indexes; Monitoring; Petri nets; Supervisory control; Testing; Vectors; Discrete event systems; Petri nets (PNs); supervisory control;
  • fLanguage
    English
  • Journal_Title
    Systems, Man, and Cybernetics: Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    2168-2216
  • Type

    jour

  • DOI
    10.1109/TSMCA.2012.2230624
  • Filename
    6573414