Complexity of metric temporal logics with counting and the Pnueli modalities

DOI10.1016/j.tcs.2010.03.017zbMath1196.03029OpenAlexW2043086238MaRDI QIDQ974119

Alexander Rabinovich

Publication date: 27 May 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.017

zbMATH Keywords

complexitytemporal logicexpressive powersatisfiability problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Temporal logic (03B44)

Related Items (7)

The Expressive Power of Temporal and First-Order Metric Logics ⋮ Bounded variability of metric temporal logic ⋮ An SMT-based approach to satisfiability checking of MITL ⋮ Continuous time temporal logic with counting ⋮ Metric Temporal Logic with Counting ⋮ Hard real-time guarantees in feedback-based resource reservations ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic

Cites Work

• Quantitative temporal logics over the reals: PSpace and below
• Models for reactivity
• Timer formulas and decidable metric temporal logic
• Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
• The benefits of relaxing punctuality
• Expressiveness of Metric modalities for continuous time
• An Expressive Temporal Logic for Real Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of metric temporal logics with counting and the Pnueli modalities