Complexity analysis of a unifying algorithm for model checking interval temporal logic
From MaRDI portal
(Redirected from Publication:821561)
Recommendations
- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
- 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
- Interval temporal logic model checking: the border between good and bad HS fragments
Cites work
- scientific article; zbMATH DE number 1696444 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A decidable weakening of compass logic based on cone-shaped cardinal directions
- A propositional modal logic of time intervals
- Checking interval properties of computations
- Decidability of model checking multi-agent systems against a class of EHS specifications
- Expressiveness and completeness of an interval tense logic
- Interval temporal logic model checking: the border between good and bad HS fragments
- Interval vs. point temporal logic model checking. An expressiveness comparison
- Intervals and tenses
- Maintaining knowledge about temporal intervals
- 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
- On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
- Tableaux for logics of subinterval structures over dense orderings
- Temporal prepositions and their logic
- The dark side of interval temporal logic: marking the undecidability border
- The undecidability of the logic of subintervals
- “Sometimes” and “not never” revisited
Cited in
(8)- Parametric interval temporal logic over infinite words
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- scientific article; zbMATH DE number 6767596 (Why is no real title available?)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- On the Complexity of Temporal-Logic Path Checking
- On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
- Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
This page was built for publication: Complexity analysis of a unifying algorithm for model checking interval temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q821561)
