Skip to Main content Skip to Navigation
Conference papers

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

Abstract : The liveness problem for timed automata asks if a given automaton has a run passing infinitely often through an accepting state. We show that unless P=NP, the liveness problem is more difficult than the reachability problem; more precisely, we exhibit a family of automata for which solving the reachability problem with the standard algorithm is in P but solving the liveness problem is NP-hard. This leads us to revisit the algorithmics for the liveness problem. We propose a notion of a witness for the fact that a timed automaton violates a liveness property. We give an algorithm for computing such a witness and compare it with the existing solutions.
Document type :
Conference papers
Complete list of metadata
Contributor : Frédéric Herbreteau Connect in order to contact the contributor
Submitted on : Saturday, December 31, 2016 - 3:21:33 AM
Last modification on : Saturday, June 25, 2022 - 10:36:57 AM
Long-term archiving on: : Saturday, April 1, 2017 - 12:04:55 PM


Publisher files allowed on an open archive




Frédéric Herbreteau, B Srivathsan, Thanh-Tung Tran, Igor Walukiewicz. Why Liveness for Timed Automata Is Hard, and What We Can Do About It. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, Dec 2016, Chennai, India. pp.48:1-48:14, ⟨10.4230/LIPIcs.FSTTCS.2016.48⟩. ⟨hal-01423714⟩



Record views


Files downloads