Robust reachability in timed automata and games: a game-based approach

DOI10.1016/j.tcs.2014.08.014zbMath1302.68153OpenAlexW1979488813MaRDI QIDQ481098

Ocan Sankur, Nicolas Markey, Patricia Bouyer

Publication date: 12 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.014

zbMATH Keywords

robustnesstimed automatamodel-checking

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Model measuring for discrete and hybrid systems ⋮ Computing maximally-permissive strategies in acyclic timed automata

Uses Software

• Kronos
• Uppaal
• Shrinktech

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust safety of timed automata
• A theory of timed automata
• Kronos: A verification tool for real-time systems
• Uppaal in a nutshell
• Dynamical properties of timed automata
• Scheduling with timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Sampled Semantics of Timed Automata
• Robust Controller Synthesis in Timed Automata
• Shrinking Timed Automata.
• Quantitative Robustness Analysis of Flat Timed Automata
• Untimed Language Preservation in Timed Systems
• Timed Automata Can Always Be Made Implementable
• Robust Reachability in Timed Automata: A Game-Based Approach
• Robust Model-Checking of Timed Automata via Pumping in Channel Machines
• Robust Specification of Real Time Components
• Symbolic Robustness Analysis of Timed Automata
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Parametric real-time reasoning
• Robust Analysis of Timed Automata Via Channel Machines
• Bounds on Multiprocessing Timing Anomalies
• Lectures on Concurrency and Petri Nets
• Sampled Universality of Timed Automata
• Timed Parity Games: Complexity and Robustness
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Robust reachability in timed automata and games: a game-based approach