scientific article; zbMATH DE number 7439732
From MaRDI portal
Publication:5015270
zbMath1478.68148arXiv1609.04090MaRDI QIDQ5015270
Alberto Molinari, Pietro Sala, Laura Bozzelli, Adriano Peron, Angelo Montanari
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1609.04090
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (4)
Model checking interval temporal logics with regular expressions ⋮ Unnamed Item ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
Uses Software
Cites Work
- Unnamed Item
- 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
- Duration calculus. A formal approach to real-time systems.
- The dark side of interval temporal logic: marking the undecidability border
- 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
- “Sometimes” and “not never” revisited
- A propositional modal logic of time intervals
- NP trees and Carnap's modal logic
This page was built for publication:
