A Hierarchical Completeness Proof for Interval Temporal Logic with Finite Time ( Preliminary Version )

Logics based on regular languages over finite words and ω-words offer a promising but elusive framework for formal specification and verification. Starting with the seminal work of Büchi [5,6] and Elgot [11] around 1960, a number of such logics and decision procedures have been proposed. In addition, various researchers have obtained complete axiom systems… CONTINUE READING