TY - JOUR
T1 - Using Subobservers to Synthesize Opacity-Enforcing Supervisors
AU - Moulton, Richard Hugh
AU - Hamgini, Behnam Behinaein
AU - Khouzani, Zahra Abedi
AU - Meira-Góes, Rômulo
AU - Wang, Fei
AU - Rudie, Karen
N1 - Funding Information:
The authors acknowledge that Queen’s University is situated on traditional Anishinaabe and Haudenosaunee Territory. The authors would like to thank Richard Ean and Bryony Schonewille of the Queen’s Discrete-Event Systems Lab as well as the reviewers for their thoughtful and constructive comments. This research was supported by the Natural Sciences and Engineering Research Council of Canada as well as the Queen’s University Faculty of Engineering and Applied Science. RHM held a Walter C. Sumner Memorial Fellowship during the conduct of this work. All figures with automata were produced using the Integrated Discrete-Event Systems Tool, Rudie (2006), which is freely available online at https://github.com/krudie/IDES.
Funding Information:
The authors would like to thank Richard Ean and Bryony Schonewille of the Queen’s Discrete-Event Systems Lab as well as the reviewers for their thoughtful and constructive comments. This research was supported by the Natural Sciences and Engineering Research Council of Canada as well as the Queen’s University Faculty of Engineering and Applied Science. RHM held a Walter C. Sumner Memorial Fellowship during the conduct of this work.
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/12
Y1 - 2022/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85138276558&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85138276558&partnerID=8YFLogxK
U2 - 10.1007/s10626-022-00365-5
DO - 10.1007/s10626-022-00365-5
M3 - Article
AN - SCOPUS:85138276558
SN - 0924-6703
VL - 32
SP - 611
EP - 640
JO - Discrete Event Dynamic Systems: Theory and Applications
JF - Discrete Event Dynamic Systems: Theory and Applications
IS - 4
ER -