Reachability Problems for Hybrid Automata

DOI10.1007/978-3-642-24288-5_4MaRDI QIDQ3172861zbMATHOpenAlexFDO

Authors Jean-François Raskin

Publication date 7 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24288-5_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On reachability for hybrid automata over bounded time
• Formal Modeling and Analysis of Timed Systems
• Some problems of analysis of hybrid automata
• Hybrid automata and bisimulations
• scientific article; zbMATH DE number 1444354
• scientific article; zbMATH DE number 2085340
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• scientific article; zbMATH DE number 1429791
• Time-bounded reachability for monotonic hybrid automata: complexity and fixed points

Cited in

(26)

• Formal language properties of hybrid systems with strong resets
• A decidable class of planar linear hybrid systems
• Deciding concurrent planar monotonic linear hybrid systems
• A new technique for reachability of states in concatenation automata
• Approximated reachability on hybrid automata: falsification meets certification
• Reachability problems on reliable and lossy queue automata
• Hybrid automata, reachability, and systems biology
• Some decidable results on reachability of solvable systems
• Weak singular hybrid automata
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• Composing Semi-algebraic O-Minimal Automata
• Reachset Conformance Testing of Hybrid Automata
• Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• What's decidable about hybrid automata?
• The Power of Hybrid Acceleration
• Decidability of the reachability for a family of linear vector fields
• Formal Modeling and Analysis of Timed Systems
• Uniformity for the decidability of hybrid automata
• A Decidable Class of Planar Linear Hybrid Systems
• scientific article; zbMATH DE number 1444354 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
• Decidable hybrid systems
• What's decidable about recursive hybrid automata?
• Introduction to hybrid automata

This page was built for publication: Reachability Problems for Hybrid Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172861)