scientific article; zbMATH DE number 7533351
From MaRDI portal
Publication:5079750
DOI10.4230/LIPIcs.CSL.2018.26MaRDI QIDQ5079750
Béatrice Bérard, Patricia Bouyer, Vincent Jugé
Publication date: 28 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamical systems\(o\)-minimal structuresreachability propertiesfinite bisimulationsintersecting trajectories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hybrid systems
- Inclusion dynamics hybrid automata
- What's decidable about hybrid automata?
- A theory of timed automata
- Polynomial interrupt timed automata
- Microcomputer technique.
- O-minimal hybrid systems.
- On the expressiveness and decidability of o-minimal hybrid systems
- Definable sets in ordered structures
- Definable Sets in Ordered Structures. III
- Reachability in Linear Dynamical Systems
- Decidable Compositions of O-Minimal Automata
- On Dedekind complete o-minimal structures
- Definable Sets in Ordered Structures. I
- Definable Sets in Ordered Structures. II
- A Theory of Program Size Formally Identical to Information Theory
- Hybrid automata with finite bisimulations
- Model Theory
- Topologies, Continuity and Bisimulations
- Hybrid Systems: Computation and Control
- A note on the undecidability of the reachability problem for o-minimal dynamical systems
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Formal Modeling and Analysis of Timed Systems
- Logical Approaches to Computational Barriers
- Analysis 1
- Linear algebra
