Lower-Bound Constrained Runs in Weighted Timed Automata

Citations Over TimeTop 13% of 2012 papers

Abstract

We investigate a number of problems related to infinite runs of weighted timed automata, subject to lower-bound constraints on the accumulated weight. Closing an open problem from an earlier paper, we show that the existence of an infinite lower-bound-constrained run is -- for us somewhat unexpectedly -- undecidable for weighted timed automata with four or more clocks. This undecidability result assumes a fixed and known initial credit. We show that the related problem of existence of an initial credit for which there exists a feasible run is decidable in PSPACE. We also investigate the variant of these problems where only bounded-duration runs are considered, showing that this restriction makes our original problem decidable in NEXPTIME. Finally, we prove that the universal versions of all those problems(i.e, checking that all the considered runs satisfy the lower-bound constraint) are decidable in PSPACE.

Related Papers

• → Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture(2016)28 cited
• → SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS(2014)1 cited
• → Some Decision Questions Concerning the Time Complexity of Language Acceptors(2013)
• → On the decidability of finite extensions of decidable fields(2018)
• → The Decision Problem for Regular First Order Theories(2025)