Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the First International Conference on Temporal Logic
ICTL '94 Proceedings of the First International Conference on Temporal Logic
A Framework for Decidable Metrical Logics
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Temporal Logic + Timed Automata: Expressiveness and Decidability
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
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
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Back to the future: towards a theory of timed regular languages
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Expressiveness of metric modalities for continuous time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
An expressive temporal logic for real time
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Continuous time temporal logic with counting
Information and Computation
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 0.00 |
We define a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Its canonical model is the real line (and not an ω-sequence of some type). We prove its decidability using general theorems from Logic (and not Automata theory). We show that it is as expressive as any alternative suggested in the literature.