2 papers
eess.SY2025
New Insights into the Decidability of Opacity in Timed Automata
Weilin Deng, Daowen Qiu, Jingkai Yang
This paper investigates the decidability of opacity in timed automata (TA), a property that has been proven to be undecidable in general. First, we address a theoretical gap in rec…
cs.FL2023
Opacity of Parametric Discrete Event Systems: Models, Decidability, and Algorithms
Weilin Deng, Daowen Qiu, Jingkai Yang
Finite automata (FAs) model is a popular tool to characterize discrete event systems (DESs) due to its succinctness. However, for some complex systems, it is difficult to describe…