Specifying message passing systems requires extending temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
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
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
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
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
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
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
Information and Computation
Timer formulas and decidable metric temporal logic
Information and Computation
Complexity of metric temporal logics with counting and the Pnueli modalities
Theoretical Computer Science
| Hi-index | 0.00 |
We add to the standard temporal logic TL(U,S) a sequence of ''counting modalities'': For each n the modality C"n(X), which says that X will be true at least at n points in the next unit of time, and its dual C