Implementing Temporal Logics: Tools for Execution and Proof (Tutorial Paper).

In this article I will present an overview of a selection of tools for execution and proof based on temporal logic, and outline both the general techniques used and problems encountered in implementing them. This selection is quite subjective, mainly concerning work that has involved researchers I have collaborated with at Liverpool (and, previously, Manchester). The tools considered will mainly be theorem-provers and (logic-based) agent programming languages. Specifically: - clausal temporal resolution [21, 28] and several of its implementations, namely , and , together with its application to verification [35]; - executable temporal logics [24, 4] and its implementation as both MetateM [3] and Concurrent MetateM [22, 49], together with its use as a programming language for both individual agents [23, 26, 29] and multi-agent systems [33, 30, 32]. In addition, I will briefly mention work on induction-based temporal proof [5], temporal logic programming [1], and model checking [7]. Rather than providing detailed algorithms, this presentation will concentrate on general principles, outlining current problems and future possibilities. The aim here is to give the reader an overview of the ways we handle temporal logics. In particular how we use such logics as the basis for both programming and verification. [ABSTRACT FROM AUTHOR]