Complexity of metric temporal logics with counting and the Pnueli modalities

DOI10.1016/J.TCS.2010.03.017MaRDI QIDQ974119zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
• Continuous time temporal logic with counting
• On the Expressiveness of MTL with Past Operators
• Quantitative temporal logics over the reals: PSpace and below
• Time-Bounded Verification
• Decidable metric logics
• Theorem proving for pointwise metric temporal logic over the naturals via translations
• Metric temporal logic with counting
• Foundations of Software Science and Computation Structures
• Revisiting MITL to fix decision procedures

Cites work

• scientific article; zbMATH DE number 747023 (Why is no real title available?)
• scientific article; zbMATH DE number 1304997 (Why is no real title available?)
• scientific article; zbMATH DE number 2112984 (Why is no real title available?)
• scientific article; zbMATH DE number 1405657 (Why is no real title available?)
• scientific article; zbMATH DE number 1424034 (Why is no real title available?)
• An Expressive Temporal Logic for Real Time
• Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
• Expressiveness of Metric modalities for continuous time
• Models for reactivity
• Quantitative temporal logics over the reals: PSpace and below
• The benefits of relaxing punctuality
• Timer formulas and decidable metric temporal logic

Cited in

(15)

• Hard real-time guarantees in feedback-based resource reservations
• Metric temporal logic with counting
• Model-Checking Counting Temporal Logics on Flat Structures
• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
• Continuous time temporal logic with counting
• Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
• Deciding continuous-time metric temporal logic with counting modalities
• An SMT-based approach to satisfiability checking of MITL
• Quantitative temporal logics over the reals: PSpace and below
• The complexity of counting models of linear-time temporal logic
• Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• On the decidability and complexity of Metric Temporal Logic over finite words
• The Expressive Power of Temporal and First-Order Metric Logics
• Bounded variability of metric temporal logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974119)