Linear temporal logic with until and next, logical consecutions

V. Rybakov
2008 Annals of Pure and Applied Logic  
While specifications and verifications of concurrent systems employ Linear Temporal Logic (LT L), it is increasingly likely that logical consequence in LT L will be used in the description of computations and parallel reasoning. Our paper considers logical consequence in the standard LT L with temporal operations U (until) and N (next). The prime result is an algorithm recognizing consecutions admissible in LT L, so we prove that LT L is decidable w.r.t. admissible inference rules. As a
more » ... nce we obtain algorithms verifying the validity of consecutions in LT L and solving the satisfiability problem. We start by a simple reduction of logical consecutions (inference rules) of LT L 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 LT L-Kripke structures with formula definable subsets. This yields necessary and sufficient conditions for a consecution to be not admissible in LT L. These conditions lead to an algorithm which recognizes consecutions (rules) admissible in LT L 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 LT L.
doi:10.1016/j.apal.2008.03.001 fatcat:ycdiicbpgba5naz4e4a3j5hr3y