Model checking interval temporal logics with regular expressions
From MaRDI portal
Recommendations
- On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
- An in-depth investigation of interval temporal logic model checking with regular expressions
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Interval temporal logic model checking: the border between good and bad HS fragments
- Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
Cites work
- scientific article; zbMATH DE number 1670780 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2038755 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 6767596 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A propositional modal logic of time intervals
- Alternation
- An in-depth investigation of interval temporal logic model checking with regular expressions
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
- 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
- From liveness to promptness
- 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 database applications
- Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete
- 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
- Regular Linear Temporal Logic
- Tableaux for logics of subinterval structures over dense orderings
- The complexity of one-agent refinement modal logic
- The dark side of interval temporal logic: marking the undecidability border
- The undecidability of the logic of subintervals
- mcmas: A Model Checker for Multi-agent Systems
- “Sometimes” and “not never” revisited
Cited in
(11)- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- Interval temporal logic model checking: the border between good and bad HS fragments
- On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
- scientific article; zbMATH DE number 6767596 (Why is no real title available?)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic
- Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
- An in-depth investigation of interval temporal logic model checking with regular expressions
- A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
- Parametric interval temporal logic over infinite words
- A quantitative extension of interval temporal logic over infinite words
- Interval Temporal Logic for Visibly Pushdown Systems
This page was built for publication: Model checking interval temporal logics with regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182727)
