Determinisability of register and timed automata

  title={Determinisability of register and timed automata},
  author={Lorenzo Clemente and Slawomir Lasota and Radoslaw Pi'orkowski},
  journal={Log. Methods Comput. Sci.},
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. An analogous problem can be stated in the setting of register automata. We draw the complete decidability/complexity landscape of the deterministic membership problem, in the setting of both register and timed automata. For register automata, we prove that the deterministic membership problem is decidable when… 
1 Citations

Register Set Automata (Technical Report)

We present register set automata (RsAs), a register automaton model over data words where registers can contain sets of data values and the following operations are supported: adding values to



Determinisability of one-clock timed automata

This work shows that the deterministic membership problem for timed automata is decidable when the input automaton is a one-clock nondeterministic timed automaton without epsilon transitions, and that the problem in all the other cases is undecidable.

When Are Timed Automata Determinizable?

An abstract procedure is proposed which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree and proves for instance that strongly non-Zeno timed automata can be determinized.

A Theory of Timed Automata

On the language inclusion problem for timed automata: closing a decidability gap

  • J. OuaknineJ. Worrell
  • Computer Science, Mathematics
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
The crux of the proof consists in reducing the language inclusion problem to a reachability question on an infinite graph, and constructing a suitable well-quasi-order on the nodes of this graph, which ensures the termination of the search algorithm.

Timed Automata and the Theory of Real Numbers

It is shown here that the binary reachability relation between configurations of a timed automaton is definable in an additive theory of real numbers, which is decidable, implying the decidability of model checking for some properties which cannot be expressed in timed temporal logics.

Timed games and deterministic separability

We study a generalisation of Buchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only Player I can

Undecidable Problems About Timed Automata

  • O. Finkel
  • Computer Science, Mathematics
  • 2006
It is shown that in the case of timed Buchi automata accepting infinite timed words some of these problems are Π11-hard, hence highly undecidable (located beyond the arithmetical hierarchy).

A game approach to determinize timed automata

This paper proposes a game-based algorithm which, given a timed automaton, tries to produce a language-equivalent deterministic timedAutomaton, otherwise a deterministic over-approximation.

Alternating timed automata

It is shown that such automata with only one clock have decidable emptiness problem over finite words and undecidability of the universality problem is shown over infinite words.