Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
From MaRDI portal
Publication:5434499
DOI10.1007/978-3-540-72734-7_6zbMath1132.68466MaRDI 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
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
Related Items
Formal language properties of hybrid systems with strong resets, Weighted o-minimal hybrid systems, Specifications for decidable hybrid games, STORMED Hybrid Systems, Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets, STORMED Hybrid Games