Formal language properties of hybrid systems with strong resets

DOI10.1051/ita/2010006zbMath1184.68309OpenAlexW2016804059MaRDI QIDQ5190079

Elaine Render, Véronique Bruyère, Thomas Brihaye

Publication date: 12 March 2010

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/44613

zbMATH Keywords

formal language theoryhybrid systems with strong resets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Equivalence checking and intersection of deterministic timed finite state machines

Uses Software

• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• Folk theorems on the determinization and minimization of timed automata
• Timed automata and recognizability
• What's decidable about hybrid automata?
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Logic and \(p\)-recognizable sets of integers
• Model theory
• Hybrid systems. Computation and control. 1st international workshop, HSCC '98, Berkeley, CA, USA, April 13--15, 1998. Proceedings
• O-minimal hybrid systems.
• On the expressiveness and decidability of o-minimal hybrid systems
• Undecidable Problems About Timed Automata
• Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
• Composing Semi-algebraic O-Minimal Automata
• Undecidability Results for Timed Automata with Silent Transitions
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Model Theory
• Hybrid Systems: Computation and Control
• Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
• A note on the undecidability of the reachability problem for o-minimal dynamical systems
• Formal Methods for the Design of Real-Time Systems
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function

This page was built for publication: Formal language properties of hybrid systems with strong resets