A game approach to determinize timed automata

DOI10.1007/978-3-642-19805-2_17zbMATH Open1326.68173OpenAlexW2152069471MaRDI QIDQ3000613FDOQ3000613

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

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

Mathematics Subject Classification ID

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

Cited In (13)

• Compositional schedulability analysis of real-time actor-based systems
• Active learning of timed automata with unobservable resets
• Bounded Determinization of Timed Automata with Silent Transitions
• On timed alternating simulation for concurrent timed games
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic Real-Time Games with Qualitative Timed Automata Objectives

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)