Temporal logic can be more expressive

Verifying properties of large sets of processes with network invariants

“…Other framework are certainly possible. One could also imagine using the same method with processes described by logical formulas, for instance temporal logic formulas [Pnu81], [EH86], [Wol83], [GS86].…”

Towards a Model-Checker for Counter Systems

“…3. We show that the decidability result described above persists in a strong extension with a class of temporal operators defined by means of CQDD (see [BH99]) in a way analogous to Wolper's Extended temporal logic [Wol83].…”

“…Our use of CQDD is different and non-regular languages can be defined with CQDD. Moreover, the model-checking problem for LTL augmented with operators defined from CQDD is undecidable [Dem06] unlike the extension with regular languages [Wol83]. By contrast, we show that the model-checking problem for FOCTL (Pr)[n] extended with CQDD-based operators is decidable over ACS.…”

“…In a seminal paper, Wolper extends LTL to an extended temporal logic that has the same power as Büchi automata [Wol83]. In this section, we extend the set of path formulae from FOCTL (Pr)[n] by allowing temporal operators defined by another class of language acceptors, namely the CQDD (constrained queue-content decision diagrams) [BH99].…”

“…For instance, in EFOCTL (Pr)[n] we can state that there is a path and some n = 0 such that φ 1 holds true at the n first positions, then φ 2 holds true at the n next positions and then neither φ 1 nor φ 2 holds true forever. It is known that ETL is more expressive that LTL [Wol83] and this result can be lifted between FOCTL (Pr)[n] and EFOCTL (Pr) [n]. Theorem 3 can be extended by allowing CQDD-based operators.…”