Complexity of ITL model checking: some well-behaved fragments of the interval logic HS

TL;DR

This paper explores the complexity of model checking in interval temporal logic HS, demonstrating that more efficient procedures can be developed for certain expressive fragments, advancing the practical applicability of interval logic in computer science.

Contribution

It introduces more efficient model checking algorithms for specific expressive fragments of the interval logic HS, improving upon previous non-elementary and EXPSPACE procedures.

Findings

More efficient model checking procedures for certain HS fragments.

Identification of well-behaved fragments with reduced complexity.

Enhanced applicability of interval temporal logic in model checking.

Abstract

Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases. Most of the proposed solutions make use of classical, point-based temporal logics, while little work has been done in the interval temporal logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham's modal logic of time intervals HS over finite Kripke structures (under the homogeneity assumption) and an EXPSPACE model checking procedure for two meaningful fragments of it have been proposed. In this paper, we show that more efficient model checking procedures can be developed for some expressive enough fragments of HS.