• DocumentCode
    27635
  • Title

    Comments on “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” versus “Decentralized Failure Diagnosis of Discrete Event Systems”: Complexity Clarification

  • Author

    Kumar, Ravindra ; Takai, Shigemasa

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
  • Volume
    59
  • Issue
    5
  • fYear
    2014
  • fDate
    May-14
  • Firstpage
    1391
  • Lastpage
    1392
  • Abstract
    An article on codiagnosability verification of discrete event systems was reported by Moreira et al, claiming an improvement in complexity over a paper by Qiu and Kumar. This note clarifies an oversight in the complexity analysis of Moreira et al´s paper. Further the results of Moreira et al´s paper were obtained in a more restricted setting of “projection masks”, in contrast to the more general “non-projection masks” allowed in Qiu and Kumar´s paper, which was overlooked. Finally in the special case when the projection masks are used, the complexity of Qiu and Kumar´s paper is lower compared to the non-projection masks case, and equals the corrected complexity of Moreira et al´s paper.
  • Keywords
    computational complexity; decentralised control; discrete event systems; failure analysis; codiagnosability verification; complexity analysis; complexity clarification; corrected complexity; decentralized diagnosability; decentralized failure diagnosis; discrete event systems; nonprojection mask; polynomial time verification; Automata; Computational complexity; Decentralized control; Discrete-event systems; Failure analysis; Automata; decetralized diagnosis; diagnosability; discrete event systems;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.2013.2283756
  • Filename
    6612722