Why Liveness for Timed Automata Is Hard, and What We Can Do About It

DOI10.4230/LIPIcs.FSTTCS.2016.48zbMath1391.68071OpenAlexW4391526569MaRDI QIDQ4636598

Frédéric Herbreteau, Thanh-Tung Tran, B. Srivathsan, Igor Walukiewicz

Publication date: 19 April 2018

Full work available at URL: https://hal.science/hal-01423714

zbMATH Keywords

timed automatamodel checkingliveness invariantstate subsumption

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Verified Certification of Reachability Checking for Timed Automata ⋮ Certifying emptiness of timed Büchi automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Why Liveness for Timed Automata Is Hard, and What We Can Do About It