Symbolic and Compositional Reachability for Timed Automata

DOI10.1007/978-3-642-15349-5_2zbMath1285.68096OpenAlexW1647694692MaRDI QIDQ3584959

Kim Guldstrand Larsen

Publication date: 31 August 2010

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-15349-5_2

Mathematics Subject Classification ID

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

Uses Software

• Uppaal
• CMC
• UPPAAL CORA

This page was built for publication: Symbolic and Compositional Reachability for Timed Automata