Verification of detectability for unambiguous weighted automata using self-composition

0578399 - MÚ 2024 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Miao, S. - Lai, A. - Yu, X. - Lahaye, S. - Komenda, Jan
Verification of detectability for unambiguous weighted automata using self-composition.
9th International Conference on Control, Decision and Information Technologies (CoDIT). Los Alamitos: IEEE, 2023 - (Califano, C.; Jabeur Telmoud, A.; Herrera Viedma, E.), s. 251-256. ISBN 979-8-3503-1141-9.
[9th International Conference on Control, Decision and Information Technologies (CoDIT). Rome (IT), 03.07.2023-06.07.2023]
Grant CEP: GA ČR(CZ) GC19-06175J
Institucionální podpora: RVO:67985840
Klíčová slova: discrete event system * unambiguous weighted automaton * self-composition * detectability * polynomial time
Obor OECD: Automation and control systems
https://doi.org/10.1109/CoDIT58514.2023.10284082

This paper aims to explore the problem of verifying detectability for unambiguous weighted automata (UWAs) through the utilization of modified self-composition. Specifically, we focus on two types of detectability: strong periodic detectability (SPD) and strong D-detectability (SDD). The problem involves periodically determining the current state or distinguishing certain state-pairs of the system, based on the occurrence of a finite number of observable events. We introduce a new polynomial-time algorithm different from the detector, called self-composition for UWAs, and prove that it can be used to verify the SPD and SDD for UWAs. Ultimately, we propose necessary and sufficient conditions based on modified self-composition techniques to verify the aforementioned detectabilities for the studied UWA.
Trvalý link: https://hdl.handle.net/11104/0347401