Using subobservers to synthesize opacity-enforcing supervisors

From MaRDI portal
Publication:2106417

DOI10.1007/S10626-022-00365-5zbMATH Open1505.93078arXiv2110.04334OpenAlexW3207178583MaRDI QIDQ2106417FDOQ2106417


Authors: Richard Hugh Moulton, Behnam Behinaein Hamgini, Zahra Abedi Khouzani, Rômulo Meira-Góes, Fei Wang, Karen Rudie Edit this on Wikidata


Publication date: 14 December 2022

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Abstract: In discrete-event system control, the worst-case time complexity for computing a system's observer is exponential in the number of that system's states. This results in practical difficulties since some problems require calculating multiple observers for a changing system, e.g., synthesizing an opacity-enforcing supervisor. Although calculating these observers in an iterative manner allows us to synthesize an opacity-enforcing supervisor and although methods have been proposed to reduce the computational demands, room exists for a practical and intuitive solution. Here we extend the subautomaton relationship to the notion of a subobserver and demonstrate its use in reducing the computations required for iterated observer calculations. We then demonstrate the subobserver relationship's power by simplifying state-of-the-art synthesis approaches for opacity-enforcing supervisors under realistic assumptions.


Full work available at URL: https://arxiv.org/abs/2110.04334




Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Using subobservers to synthesize opacity-enforcing supervisors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106417)