Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

DOI10.1007/978-3-540-72734-7_6zbMath1132.68466OpenAlexW1534354603MaRDI QIDQ5434499

Patricia Bouyer, Fabrice Chevalier, Thomas Brihaye

Publication date: 4 January 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72734-7_6

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Weighted o-minimal hybrid systems ⋮ STORMED Hybrid Systems ⋮ Specifications for decidable hybrid games ⋮ Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets ⋮ Formal language properties of hybrid systems with strong resets ⋮ STORMED Hybrid Games

This page was built for publication: Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!