Quantitative temporal logics over the reals: PSpace and below
DOI10.1016/J.IC.2006.08.006zbMATH Open1109.03012OpenAlexW2148573667MaRDI QIDQ868030FDOQ868030
D. Walther, Carsten Lutz, F. 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
Recommendations
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- The complexity of temporal logic over the reals
- Temporal logics over linear time domains are in PSPACE
- Temporal logics over linear time domains are in PSPACE
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44)
Cites Work
- The complexity of propositional linear temporal logics
- A really temporal logic
- The benefits of relaxing punctuality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axioms for real-time logics
- The complexity of temporal logic over the reals
- Reasoning in a restricted temporal logic
- Finite divergence
- Accepting zeno words: A way toward timed refinements
- Automated Technology for Verification and Analysis
Cited In (12)
- Incremental classification of description logics ontologies
- A survey on temporal logics for specifying and verifying real-time systems
- Dynamic contact algebras and quantifier-free logics for space and time
- The complexity of temporal logic over the reals
- Title not available (Why is that?)
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Time-Bounded Verification
- On the Priorean temporal logic with \([d]\) over the real line
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- MTL with Bounded Variability: Decidability and Complexity
- Bounded variability of metric temporal logic
- On the complexity of verification of time-sensitive distributed systems
This page was built for publication: Quantitative temporal logics over the reals: PSpace and below
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868030)
