When Are Timed Automata Determinizable?
From MaRDI portal
Publication:3638084
DOI10.1007/978-3-642-02930-1_4zbMath1248.68284OpenAlexW2144360108MaRDI QIDQ3638084
Thomas Brihaye, Nathalie Bertrand, Patricia Bouyer, Christel Baier
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_4
Related Items (16)
Metric temporal logic revisited ⋮ Model Checking Real-Time Systems ⋮ Minimization of the number of clocks for timed scenarios ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ Predictive runtime enforcement ⋮ Bounded Determinization of Timed Automata with Silent Transitions ⋮ An efficient customized clock allocation algorithm for a class of timed automata ⋮ Bounded determinization of timed automata with silent transitions ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ Model checking weighted integer reset timed automata ⋮ A game approach to determinize timed automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Introduction to Timed Automata ⋮ Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language
This page was built for publication: When Are Timed Automata Determinizable?
