Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Parametric timing analysis for real-time systems
Information and Computation
Specification of realtime systems using ASTRAL
IEEE Transactions on Software Engineering
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Hi-index | 0.00 |
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 A and a Presburger property P, whether there exists an ω-path of A where P holds infinitely often. We also show that other classes of Presburger liveness properties are indeed undecidable for discrete timed automata, e.g., whether P holds infinitely often for each ω-path of A. 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 with Presburger conditions on configurations, which is decidable for model checking timed automata.