Improving Search Order for Reachability Testing in Timed Automata

DOI10.1007/978-3-319-22975-1_9zbMath1465.68148arXiv1506.07000OpenAlexW837480072MaRDI QIDQ2945591

Frédéric Herbreteau, Thanh-Tung Tran

Publication date: 14 September 2015

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Efficient convex zone merging in parametric timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Search-Order Independent State Caching
• Computer Aided Verification

This page was built for publication: Improving Search Order for Reachability Testing in Timed Automata