Manchester Metropolitan University's Research Repository

Linear temporal logic with until and next, logical consecutions

Rybakov, Vladimir V. (2008) Linear temporal logic with until and next, logical consecutions. Annals of pure and applied logic, 155 (1). pp. 32-45. ISSN 1873-2461

Full text not available from this repository.


While specifications and verifications of concurrent systems employ Linear Temporal Logic (), it is increasingly likely that logical consequence in will be used in the description of computations and parallel reasoning. Our paper considers logical consequence in the standard with temporal operations (until) and (next). The prime result is an algorithm recognizing consecutions admissible in , so we prove that is decidable w.r.t. admissible inference rules. As a consequence we obtain algorithms verifying the validity of consecutions in and solving the satisfiability problem. We start by a simple reduction of logical consecutions (inference rules) of to equivalent ones in the reduced normal form (which have uniform structure and consist of formulas of temporal degree 1). Then we apply a semantic technique based on -Kripke structures with formula definable subsets. This yields necessary and sufficient conditions for a consecution to be not admissible in . These conditions lead to an algorithm which recognizes consecutions (rules) admissible in by verifying the validity of consecutions in special finite Kripke structures of size square polynomial in reduced normal forms of the consecutions. As a consequence, this also solves the satisfiability problem for LTL.

Impact and Reach


Activity Overview

Additional statistics for this dataset are available via IRStats2.


Actions (login required)

View Item View Item