Weighted o-minimal hybrid systems

DOI10.1016/j.apal.2009.07.014zbMath1219.68114OpenAlexW2035999266MaRDI QIDQ636266

Fabrice Chevalier, Patricia Bouyer, Thomas Brihaye

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.07.014

zbMATH Keywords

decidabilitymodel checkingtemporal logico-minimal hybrid systemsoptimal o-minimal hybrid games

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

Weighted o-minimal hybrid systems ⋮ Specifications for decidable hybrid games

Uses Software

• UPPAAL CORA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted o-minimal hybrid systems
• The algorithmic analysis of hybrid systems
• Improved undecidability results on weighted timed automata
• CCS expressions, finite state processes, and three problems of equivalence
• A theory of timed automata
• O-minimal hybrid systems.
• On the optimal reachability problem of weighted timed automata
• On the expressiveness and decidability of o-minimal hybrid systems
• On model-checking timed automata with stopwatch observers
• Three Partition Refinement Algorithms
• Definable Sets in Ordered Structures. I
• Hybrid automata with finite bisimulations
• Topologies, Continuity and Bisimulations
• A classification of symbolic transition systems
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Almost Optimal Strategies in One Clock Priced Timed Games
• Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
• Model-Checking One-Clock Priced Timed Automata
• Formal Modeling and Analysis of Timed Systems
• Formal Modeling and Analysis of Timed Systems
• Logical Approaches to Computational Barriers