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

DOI10.1145/3372310zbMath1446.68068OpenAlexW3010307732MaRDI QIDQ5121268

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

Publication date: 11 September 2020

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6883/

zbMATH Keywords

complexityalgorithmstimed automataliveness verification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Efficient convex zone merging in parametric timed automata

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