Linear temporal logic with until and before on integer numbers, deciding algorithms

• Authors: V. Rybakov
• Venue: CSR'06 Proceedings of the First international computer science conference on Theory and Applications
• Year: 2006

As specifications and verifications of concurrent systems employ Linear Temporal Logic (LTL), it is increasingly likely that logical consequence in LTL will be used in description of computations and parallel reasoning. We consider the linear temporal logic $\mathcal{LTL^{U,B}_{N,N^{-1}} (Z)}$ extending the standard LTL by operations B (before) and N−1 (previous). Two sorts of problems are studied: (i) satisfiability and (ii) description of logical consequence in $\mathcal{LTL^{U,B}_{N,N^{-1}} (Z)}$ via admissible logical consecutions (inference rules). The model checking for LTL is a traditional way of studying such logics. Most popular technique based on automata was developed by M.Vardi (cf. [39, 6]). Our paper uses a reduction of logical consecutions and formulas of LTL to consecutions of a uniform form consisting of formulas of temporal degree 1. Based on technique of Kripke structures, we find necessary and sufficient conditions for a consecution to be not admissible in $\mathcal{LTL^{U,B}_{N,N^{-1}} (Z)}$. This provides an algorithm recognizing consecutions (rules) admissible in $\mathcal{LTL^{U,B}_{N,N^{-1}} (Z)}$ by Kripke structures of size linear in the reduced normal forms of the initial consecutions. As an application, this algorithm solves also the satisfiability problem for $\mathcal{LTL^{U,B}_{N,N^{-1}} (Z)}$.