Uniformity for the decidability of hybrid automata

DOI10.1007/3-540-61739-6_49zbMath1482.68127OpenAlexW1538288378MaRDI QIDQ5030200

Olivier Roux, Vlad Rusu

Publication date: 16 February 2022

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61739-6_49

zbMATH Keywords

uniformityhybrid automatadecidabilitysymbolic verificationtemporal logic TCTL

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Monitoring of dynamic processes by rectangular hybrid automata

Cites Work

• Symbolic model checking for real-time systems
• Decidable integration graphs.
• Hybrid automata with finite bisimulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniformity for the decidability of hybrid automata