Abstraction refinement algorithms for timed automata

DOI10.1007/978-3-030-25540-4_2arXiv1905.07365MaRDI QIDQ6154573

Nicolas Markey, Ocan Sankur, Victor Roussanaly

Publication date: 16 February 2024

Published in: Computer Aided Verification (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Spotlight abstraction in model checking real-time task schedulability ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Abstraction refinement algorithms for timed automata