The complexity of almost linear diophantine problems
Journal of Symbolic Computation
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)
Specification of realtime systems using ASTRAL
IEEE Transactions on Software Engineering
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
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
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
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
On-the-fly symbolic model checking for real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Linear reachability problems and minimal solutions to linear Diophantine equation systems
Theoretical Computer Science - Implementation and application of automata
LTL Over integer periodicity constraints
Theoretical Computer Science
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Hi-index | 5.23 |
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.