Complexity of Verifying Nonblockingness in Modular Supervisory Control
From MaRDI portal
Publication:4567109
DOI10.1109/TAC.2017.2726582zbMath1390.93529arXiv1703.05011OpenAlexW2598639991MaRDI QIDQ4567109
Publication date: 27 June 2018
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05011
Analysis of algorithms and problem complexity (68Q25) Discrete event control/observation systems (93C65)
Related Items (4)
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems ⋮ A model-based deep reinforcement learning approach to the nonblocking coordination of modular supervisors of discrete event systems ⋮ Complexity of deciding detectability in discrete event systems ⋮ On verification of D-detectability for discrete event systems
This page was built for publication: Complexity of Verifying Nonblockingness in Modular Supervisory Control
