Efficient bounded reachability computation for rectangular automata

DOI10.1007/978-3-642-24288-5_13MaRDI QIDQ3172871zbMATH OpenOpenAlexFDO

Authors Xin Chen, Erika Ábrahám, Goran Frehse

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(3)

• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• scientific article; zbMATH DE number 1836354 (Why is no real title available?)
• Efficient convex zone merging in parametric timed automata

Describes a project that uses

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)