• DocumentCode
    2381146
  • Title

    Supervisory control of Timed State Tree Structures

  • Author

    Saadatpoor, A. ; Ma, C. ; Wonham, W.M.

  • fYear
    2008
  • fDate
    11-13 June 2008
  • Firstpage
    477
  • Lastpage
    482
  • Abstract
    It is well known that the nonblocking supervisory control problem is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. The problem of state explosion is more challenging in Timed DES than in untimed DES. In this paper we propose to manage complexity by organizing the system as a Timed State Tree Structure (TSTS). Based on TSTS we present an efficient recursive algorithm that can perform nonblocking supervisory control design (in reasonable time and memory) for systems of state size 1012 and higher.
  • Keywords
    computational complexity; discrete event systems; trees (mathematics); NP-hard problem; dicrete event systems; recursive algorithm; state space explosion; supervisory control; timed state tree structures; Binary decision diagrams; Boolean functions; Control systems; Data structures; Explosions; Organizing; Sociotechnical systems; State-space methods; Supervisory control; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference, 2008
  • Conference_Location
    Seattle, WA
  • ISSN
    0743-1619
  • Print_ISBN
    978-1-4244-2078-0
  • Electronic_ISBN
    0743-1619
  • Type

    conf

  • DOI
    10.1109/ACC.2008.4586537
  • Filename
    4586537
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2381146