… of traces (language-based opacity) or subsets of states (state-based opacity), opaque to
the … the opacity problems of real-time automata (RTA), which is a popular model for real-time …

… , current-state opacity, infinite-step opacity, and K-step opacity, respectively. In this paper, …
versions of opacity for real-time automata which are a widely-used model of real-time systems, …

… initial-state opacity to real-time automata [13]. Real-time automata is a class of timed automata
with a single clock which is reset at each transition, also regarded as finite automata with …

… , current-state opacity, infinite-step opacity, and K-step opacity, respectively. In this paper, …
of opacity for labeled real-time automata which are a widely-used model of real-time systems, …

… opacity and restricts the applicability. In [13], [14], and [19], state-based notions of opacity are
adopted to real time automata (… automata as a restricted subclass of timed automata, where …

… of opacity within timed automata: language-based timed opacity, initial-location timed opacity,
and current-location timed opacity. … of the opacity problem for one-clock timed automata. …

… In addition, although CTLAs are a subclass of real-time automata, the verification of timed
opacity proposed in this paper cannot benefit from the approaches presented in [29] and [30] …

… model is simplified to real-time automata [24], a … automata, a subclass of real-time automata
where events occur at constant values. In this setting, initial-state and current-state opacity …

… Timed automata (TAs) [2] are an extension of finite automata … finite automata with the ability
to handle real-time constraints. … , enabling the modeling and verification of real-time systems. …

… First, in [24,25], the input model is simplified to real-time automata [16], 12 a restricted
formalism compared to TAs. In this setting, (initial-state) opacity 13 becomes decidable [24,25]. …