Robust Reachability in Timed Automata: A Game-Based Approach

DOI10.1007/978-3-642-31585-5_15zbMath1367.68161OpenAlexW64121912MaRDI QIDQ3167005

Nicolas Markey, Patricia Bouyer, Ocan Sankur

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_15

Mathematics Subject Classification ID

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

Related Items (5)

Shrinking timed automata ⋮ Automata-theoretic decision of timed games ⋮ Testing membership for timed automata ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Parameter synthesis for hierarchical concurrent real-time systems

Uses Software

• Kronos

This page was built for publication: Robust Reachability in Timed Automata: A Game-Based Approach