O-Minimal Hybrid Reachability Games

DOI10.2168/LMCS-6(1:1)2010zbMath1189.68070OpenAlexW3098296430MaRDI QIDQ5190321

Fabrice Chevalier, Patricia Bouyer, Thomas Brihaye

Publication date: 15 March 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-6(1:1)2010

zbMATH Keywords

synthesiso-minimal hybrid systemsreachability games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Observability (93B07) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03)

Related Items (5)

Differential Game Logic ⋮ Crossing the Bridge between Similar Games ⋮ Automata-theoretic decision of timed games ⋮ A game-theoretic approach to fault diagnosis and identification of hybrid systems ⋮ Verification and control for probabilistic hybrid automata with finite bisimulations

This page was built for publication: O-Minimal Hybrid Reachability Games