In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where resets are restricted to occur at integral ...

In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where resets are restricted to occur at integral ...

As our main result, we show that the language inclusion problem. L(A) ⊆ L(B) for a timed automaton A and an IRTA B is decidable with. EXPSPACE complexity. The ...

In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where <em>resets</em>are restricted to occur at ...

• Integer Reset Timed Automata (IRTA): Clock resets happen at integral time ... Timed automata with integer resets: Language inclusion and expressiveness.

In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree.

We introduce a new variant of timed automata called GRTA. We show that for every ε-IRTA we can effectively construct a language equivalent 1-clock, ...

We introduce a new variant of timed automata called GRTA. We show that for every ε-IRTA we can effectively construct a language equivalent 1-clock, ...

Oct 3, 2024 · A Nerode-like equivalence has been studied for various classes of timed languages. In this work, we focus on timed automata with integer resets.

Timed Automata with Integer Resets: Language Inclusion and Expressiveness.