Expressiveness of Metric modalities for continuous time
From MaRDI portal
Publication:5310679
DOI10.2168/LMCS-3(1:3)2007zbMATH Open1128.03007OpenAlexW2512926276MaRDI QIDQ5310679FDOQ5310679
Authors: Alexander Rabinovich, Yoram Hirshfeld
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-3(1:3)2007
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (19)
- Metric temporal logic revisited
- Title not available (Why is that?)
- An Expressive Temporal Logic for Real Time
- Continuous time temporal logic with counting
- An SMT-based approach to satisfiability checking of MITL
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Title not available (Why is that?)
- Decidable metric logics
- When is metric temporal logic expressively complete?
- The Expressive Power of Temporal and First-Order Metric Logics
- Expressive completeness for metric temporal logic
- On the expressiveness of TPTL and MTL
- Time-Bounded Verification
- Expressiveness of Metric Modalities for Continuous Time
- Metric temporal reasoning with less than two clocks
- Preservation of expressive completeness in temporal models
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- Continuous accessibility modal logics
- Linear Time Monitoring for One Variable TPTL
This page was built for publication: Expressiveness of Metric modalities for continuous time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310679)