Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in 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
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th 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
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
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
Complexity of metric temporal logics with counting and the Pnueli modalities
Theoretical Computer Science
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
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
Expressive Completeness for Metric Temporal Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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 @w-sequence of some type). It can be interpreted either by behaviors with finite variability or by unrestricted behaviors. For finite variability models it is as expressive as any logic suggested in the literature. For unrestricted behaviors our treatment is new. In both cases we prove decidability and complexity bounds using general theorems from logic (and not from automata theory). The technical proof uses a sublanguage of the metric monadic logic of order, the language of timer normal form formulas. Metric formulas are reduced to timer normal form and timer normal form formulas allow elimination of the metric.