On Presburger Liveness of Discrete Timed Automata

Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on configurations are allowed. While the general problem of checking a temporal logic such as TPTL augmented with Presburger clock constraints is undecidable, we show that there are various classes of Presburger liveness properties which are decidable for discrete timed automata. For instance, it is decidable, given a discrete timed automaton ¦ and a Presburger property § , whether there exists an ¨ -path of ¦ where § holds infinitely often. We also show that other classes of Presburger liveness properties are indeed undecidable for discrete timed automata, e.g., whether § holds infinitely often for each ¨ -path of ¦ . These results might give insights into the corresponding problems for timed automata over dense domains, and help in the definition of a fragment of linear temporal logic, augmented wi...

• Type: Conference
• Year: 2001
• Where: STACS
• Authors: Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
• Keywords: Discrete Timed Automata, Presburger Liveness Properties, STACS 2001, Theoretical Computer Science, Timed Automata