On Reachability for Hybrid Automata over Bounded Time

DOI10.1007/978-3-642-22012-8_33zbMath1300.68033arXiv1104.5335OpenAlexW1854945613MaRDI QIDQ3012937

Gilles Geeraerts, Laurent Doyen, Joël Ouaknine, Thomas Brihaye, Jean-François Raskin, James Worrell

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.5335

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Attainable sets, reachability (93B03)

Related Items (6)

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling ⋮ Model measuring for discrete and hybrid systems ⋮ Verification of Hybrid Systems ⋮ Interrupt timed automata: verification and expressiveness ⋮ Parameter synthesis of polynomial dynamical systems ⋮ A Survey on Analog Models of Computation

Uses Software

• PHAVer
• HyTech

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• What's decidable about hybrid automata?
• A theory of timed automata
• HyTech: A model checker for hybrid systems
• Time-Bounded Verification
• Towards a Theory of Time-Bounded Verification
• A Decision Procedure for the First Order Theory of Real Addition with Order

This page was built for publication: On Reachability for Hybrid Automata over Bounded Time