This paper addresses the problem of language opacity for a class of discrete-event systems whose transitions occur within some known time interval. For this purpose, a class of timed automata is proposed, time-interval automata (TIA), in which the elapsed time is associated with a global clock, allowing each transition to be associated with a time interval of occurrence. Procedures to do operations with TIA and language-based definition of opacity notions for this class of timed automata, have been presented in previous works as well as an algorithm for its verification. In this paper, we improve these notions of timed language-based opacity (TLBO), in order to capture more nuances that appear when time is taken into account.
