Real-Time Logics: Complexity and Expressiveness

@article{Alur1993RealTimeLC,
  title={Real-Time Logics: Complexity and Expressiveness},
  author={R. Alur and T. Henzinger},
  journal={Inf. Comput.},
  year={1993},
  volume={104},
  pages={35-77}
}
The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about real-time systems, we combine this classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. The resulting theory of timed state sequences is shown to be decidable, albeit nonelementary, and its expressive power is characterized by… Expand
549 Citations
Logics for Real Time: Decidability and Complexity
  • 119
Decidable metric logics
  • 4
  • PDF
Time-Bounded Verification
  • 28
  • PDF
Programming in Metric Temporal Logic
  • C. Brzoska
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1998
  • 9
Comparing Expressive Power of Timed Logics BTP report
  • PDF
A Decidable Timeout based Extension of Propositional Linear Temporal Logic
  • 1
  • PDF
A survey on temporal logics for specifying and verifying real-time systems
  • Savas Konur
  • Computer Science
  • Frontiers of Computer Science
  • 2013
  • 25
  • Highly Influenced
  • PDF
Real-time and Probabilistic Temporal Logics: An Overview
  • 15
  • Highly Influenced
  • PDF
A Logical Characterization of Timed (non-)Regular Languages
  • 10
  • Highly Influenced
  • PDF
The complexity of Decision Problems for Linear Temporal Logics
  • 21
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 98 REFERENCES
Real-time logics: complexity and expressiveness
  • R. Alur, T. Henzinger
  • Mathematics, Computer Science
  • [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
  • 1990
  • 196
Back to the future: towards a theory of timed regular languages
  • R. Alur, T. Henzinger
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
  • 94
  • PDF
Logics and Models of Real Time: A Survey
  • 661
  • PDF
Quantitative Temporal Reasoning
  • 106
  • PDF
The Benefits of Relaxing Punctuality
  • 279
  • PDF
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
  • 396
Propositional Dynamic Logic of Nonregular Programs
  • 94
  • PDF
The complexity of propositional linear temporal logics
  • 863
  • PDF
...
1
2
3
4
5
...