Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption

DOI10.4230/LIPIcs.ICALP.2017.120zbMath1442.68103OpenAlexW2740128568MaRDI QIDQ5111452

Pietro Sala, Alberto Molinari, Laura Bozzelli, Adriano Peron, Angelo Montanari

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.120

zbMATH Keywords

computational complexitydecidabilitymodel checkingsatisfiabilityinterval temporal logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44) Computational aspects of satisfiability (68R07)

Related Items (7)

Complexity analysis of a unifying algorithm for model checking interval temporal logic ⋮ \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Unnamed Item ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ On a Temporal Logic of Prefixes and Infixes.

This page was built for publication: Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption