A game approach to determinize timed automata

DOI10.1007/978-3-642-19805-2_17MaRDI QIDQ3000613zbMATH OpenOpenAlexFDO

Authors Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A game approach to determinize timed automata
• When Are Timed Automata Determinizable?
• On the determinization of timed systems
• Automata-theoretic decision of timed games
• Bounded determinization of timed automata with silent transitions

Cited in

(15)

• Compositional schedulability analysis of real-time actor-based systems
• Active learning of timed automata with unobservable resets
• On timed alternating simulation for concurrent timed games
• A unifying approach to decide relations for timed automata and their game characterization
• A game approach to determinize timed automata
• Synthesising succinct strategies in safety games with an application to real-time scheduling
• CONCUR 2005 – Concurrency Theory
• When Are Timed Automata Determinizable?
• Model-Checking Timed ATL for Durational Concurrent Game Structures
• Bounded determinization of timed automata with silent transitions
• Bounded determinization of timed automata with silent transitions
• scientific article; zbMATH DE number 6862072 (Why is no real title available?)
• Stochastic Real-Time Games with Qualitative Timed Automata Objectives
• scientific article; zbMATH DE number 2086509 (Why is no real title available?)
• Automata-theoretic decision of timed games

This page was built for publication: A game approach to determinize timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000613)