A Game Approach to Determinize Timed Automata
From MaRDI portal
Publication:3000613
DOI10.1007/978-3-642-19805-2_17zbMath1326.68173OpenAlexW2152069471MaRDI QIDQ3000613
Moez Krichen, Amélie Stainer, Thierry Jéron, Nathalie Bertrand
Publication date: 19 May 2011
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_17
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Synthesising succinct strategies in safety games with an application to real-time scheduling ⋮ Bounded Determinization of Timed Automata with Silent Transitions ⋮ Bounded determinization of timed automata with silent transitions ⋮ Active learning of timed automata with unobservable resets ⋮ Compositional schedulability analysis of real-time actor-based systems ⋮ A game approach to determinize timed automata