Lazy reachability checking for timed automata using interpolants

DOI10.1007/978-3-319-65765-3_15zbMath1494.68174OpenAlexW2739957888MaRDI QIDQ1683455

Tamás Tóth, István Majzik

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-65765-3_15

zbMATH Keywords

interpolationreachabilitytimed automatamodel checkingzone abstraction

Mathematics Subject Classification ID

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

Related Items (3)

Configurable verification of timed automata with discrete variables ⋮ Lazy Reachability Checking for Timed Automata with Discrete Variables ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Lazy reachability checking for timed automata using interpolants