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

DOI10.1016/J.TCS.2014.08.014zbMATH Open1302.68153OpenAlexW1979488813MaRDI QIDQ481098FDOQ481098

Authors: Patricia Bouyer, Nicolas Markey, Ocan Sankur 

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

Recommendations

• Robust reachability in timed automata: a game-based approach
• Probabilistic robust timed games
• Timed Parity Games: Complexity and Robustness
• Timed Parity Games: Complexity and Robustness
• Reachability-Time Games on Timed Automata

zbMATH Keywords

robustnesstimed automatamodel-checking

Mathematics Subject Classification ID

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

Cites Work

• Kronos: A verification tool for real-time systems
• Uppaal in a nutshell
• A theory of timed automata
• Lectures on Concurrency and Petri Nets
• Bounds on Multiprocessing Timing Anomalies
• CONCUR 2005 – Concurrency Theory
• Title not available (Why is that?)
• Using non-convex approximations for efficient analysis of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parametric real-time reasoning
• Robust safety of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• Shrinking timed automata
• Quantitative robustness analysis of flat timed automata
• 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
• Timed Parity Games: Complexity and Robustness
• Sampled semantics of timed automata
• Symbolic Robustness Analysis of Timed Automata
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Title not available (Why is that?)
• Real-time systems. Design principles for distributed embedded applications.
• Dynamical properties of timed automata
• Scheduling with timed automata
• Robust Controller Synthesis in Timed Automata
• Untimed Language Preservation in Timed Systems
• Robust Analysis of Timed Automata Via Channel Machines
• Sampled Universality of Timed Automata

Cited In (5)

• Computing maximally-permissive strategies in acyclic timed automata
• Robust reachability in timed automata: a game-based approach
• A game approach to determinize timed automata
• Model measuring for discrete and hybrid systems
• Probabilistic robust timed games

Uses Software

• Kronos
• Uppaal
• Shrinktech

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

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