2 citations · 2 across the 1 of their papers we have counts for
3 papers
Determinisability of register and timed automata
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
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 autom…
Determinisability of one-clock timed automata
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
The deterministic membership problem for timed automata asks whether the timed language recognised by a nondeterministic timed automaton can be recognised by a deterministic timed…
Timed games and deterministic separability
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
We study a generalisation of Büchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only…