The paper presents a tableau calculus for a linear time temporal logic for reasoning about processes and events in concurrent systems. The logic is based on temporal connectives in the style of Transaction Logic [BK94] and explicit quantification over states. The language extends first-order logic with sequential and parallel conjunction, parallel disjunction, and temporal implication. Explicit quantification over states via state variables allows to express temporal properties which cannot be formulated in modal logics. Using the tableau representation of temporal Kripke structures presented for CTL in [MS96] which represents states by prefix terms, explicit quantification over states is integrated into the tableau calculus by an adaptation of the δ-rule from first-order tableau calculi to the linear ordering of the universe of states. Complementing the CTL calculus, the paper shows that this tableau representation is both suitable for modal temporal logics and for logics using temporal connectives.
May, W. (1999). A tableau calculus for a temporal logic with temporal connectives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1617, pp. 232–246). Springer Verlag. https://doi.org/10.1007/3-540-48754-9_21