Complexity of Verifying Nonblockingness in Modular Supervisory Control

Tomáš MasopustTomáš Masopust

ISSN: 0018-9286
Download
DOI Link

Tomáš Masopust
Complexity of Verifying Nonblockingness in Modular Supervisory Control
IEEE Transactions on Automatic Control, 63(2):602-607, 2018

Details
Bibtex

KurzfassungAbstract
Complexity analysis becomes a common task in supervisory control. However, many results of interest are spread across different topics. The aim of this paper is to bring several interesting results from complexity theory and to illustrate their relevance to supervisory control by proving new nontrivial results concerning nonblockingness in modular supervisory control of discrete event systems modeled by finite automata.
Weitere Informationen unter:Further Information: Link
Projekt:Project: Cfaed, DIAMOND
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@article{M2018,
  author    = {Tom{\'{a}}{\v{s}} Masopust},
  title     = {Complexity of Verifying Nonblockingness in Modular Supervisory
               Control},
  journal   = {IEEE Transactions on Automatic Control},
  volume    = {63},
  number    = {2},
  publisher = {IEEE},
  year      = {2018},
  pages     = {602-607},
  doi       = {10.1109/TAC.2017.2726582}
}