Complexity analysis of a unifying algorithm for model checking interval temporal logic
From MaRDI portal
Publication:821561
DOI10.1016/j.ic.2020.104640OpenAlexW3097184372MaRDI QIDQ821561
Angelo Montanari, Laura Bozzelli, Adriano Peron
Publication date: 21 September 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11376/
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Checking interval properties of computations
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- Intervals and tenses
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Model checking interval temporal logics with regular expressions
- The dark side of interval temporal logic: marking the undecidability border
- Expressiveness and completeness of an interval tense logic
- Temporal prepositions and their logic
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments
- Tableaux for Logics of Subinterval Structures over Dense Orderings
- A decidable weakening of Compass Logic based on cone-shaped cardinal directions
- “Sometimes” and “not never” revisited
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A propositional modal logic of time intervals
- Interval vs. Point Temporal Logic Model Checking
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
- The Undecidability of the Logic of Subintervals
This page was built for publication: Complexity analysis of a unifying algorithm for model checking interval temporal logic
