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.
Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS / Molinari, Alberto; Montanari, Angelo; Peron, Adriano. - (2015), pp. 90-100. (Intervento presentato al convegno Temporal Representation and Reasoning (TIME), 2015 22nd International Symposium on tenutosi a Kassel, Germany nel 23-25 Sept. 2015) [10.1109/TIME.2015.12].
Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS
PERON, ADRIANO
2015
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
