Robust Controller Synthesis in Timed Automata

DOI10.1007/978-3-642-40184-8_38zbMath1390.68416OpenAlexW1519685353MaRDI QIDQ2842132

Patricia Bouyer, Pierre-Alain Reynier, Nicolas Markey, Ocan Sankur

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40184-8_38

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Shrinking timed automata ⋮ Timed Symbolic Dynamics ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Computing maximally-permissive strategies in acyclic timed automata ⋮ Entropy of regular timed languages

This page was built for publication: Robust Controller Synthesis in Timed Automata