Quantitative temporal logics over the reals: PSpace and below

DOI10.1016/j.ic.2006.08.006zbMath1109.03012OpenAlexW2148573667MaRDI QIDQ868030

Dirk Walther, Carsten Lutz, Frank Wolter

Publication date: 19 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.08.006

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44)

Related Items (8)

Time-Bounded Verification ⋮ On the complexity of verification of time-sensitive distributed systems ⋮ Bounded variability of metric temporal logic ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities ⋮ MTL with Bounded Variability: Decidability and Complexity ⋮ Incremental classification of description logics ontologies ⋮ Complexity of metric temporal logics with counting and the Pnueli modalities

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of temporal logic over the reals
• Finite divergence
• Reasoning in a restricted temporal logic
• Accepting zeno words: A way toward timed refinements
• The complexity of propositional linear temporal logics
• A really temporal logic
• The benefits of relaxing punctuality
• Automated Technology for Verification and Analysis
• Axioms for real-time logics

This page was built for publication: Quantitative temporal logics over the reals: PSpace and below