Complexity of metric temporal logics with counting and the Pnueli modalities
From MaRDI portal
Publication:974119
DOI10.1016/J.TCS.2010.03.017zbMATH Open1196.03029OpenAlexW2043086238MaRDI QIDQ974119FDOQ974119
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
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
- Timer formulas and decidable metric temporal logic
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- Title not available (Why is that?)
- The benefits of relaxing punctuality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Expressiveness of Metric modalities for continuous time
- An Expressive Temporal Logic for Real Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantitative temporal logics over the reals: PSpace and below
- Models for reactivity
Cited In (15)
- Continuous time temporal logic with counting
- An SMT-based approach to satisfiability checking of MITL
- The complexity of counting models of linear-time temporal logic
- On the decidability and complexity of Metric Temporal Logic over finite words
- Hard real-time guarantees in feedback-based resource reservations
- Metric temporal logic with counting
- The Expressive Power of Temporal and First-Order Metric Logics
- Deciding continuous-time metric temporal logic with counting modalities
- From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
- Quantitative temporal logics over the reals: PSpace and below
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- Bounded variability of metric temporal logic
- Model-Checking Counting Temporal Logics on Flat Structures
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)