Checking Interval Properties of Computations

Model checking is a powerful method widely explored in formal verification. Given a model of a system, e. g. A Kripke structure, and a formula specifying its expected behavior, one can verify whether the system meets the behavior by checking the formula against the model. Classically, system behavior is given as a formula of a temporal logic, such as LTL and the like. These logics are "point-wise" interpreted, as they describe how the system evolves state-by-state. However, there are relevant properties, such as those involving temporal aggregations, which are inherently "interval-based", and thus asking for an interval temporal logic. In this paper, we give a formalization of the model checking problem in an interval logic setting. First, we provide an interpretation of formulas of Halpern and Shoham's interval temporal logic HS over Kripke structures, which allows one to check interval properties of computations. Then, we prove that the model checking problem for HS against Kripke structures is decidable by a suitable small model theorem, and we outline a PSpace decision procedure for the meaningful fragments AAbarBBbar and AAbarEEbar.

Authors

• Angelo Montanari
• Aniello Murano
• Giuseppe Perelli
• Adriano Peron

Keywords

• Abstracts
• Model checking
• Labeling
• Artificial intelligence
• Bismuth
• Semantics
• Computational modeling
• Formal Verification
• Temporal Logic
• Set Of Equations
• Set Of Elements
• Linear Order
• Loop Iteration
• Linear Logic
• Finite Structure