Efficient bounded reachability computation for rectangular automata

DOI10.1007/978-3-642-24288-5_13zbMATH Open1348.68097OpenAlexW94054824MaRDI QIDQ3172871FDOQ3172871

Goran Frehse, Xin Chen, Erika Ábrahám

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_13

Recommendations

• On reachability for hybrid automata over bounded time
• What's decidable about hybrid automata?
• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• Time-bounded reachability for monotonic hybrid automata: complexity and fixed points
• Hybrid Systems: Computation and Control

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (3)

• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• Efficient convex zone merging in parametric timed automata
• Title not available (Why is that?)

Uses Software

• PHAVer
• SpaceEx

This page was built for publication: Efficient bounded reachability computation for rectangular automata

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