### Table 4: Temporal Logic

1999

"... In PAGE 7: ... Therefore, when formally specifying behavioral constraints, the property speci er is guided by a tool that allows him to assemble the di erent events and to temporally relate the events to each other. For the establishment of a temporal relationship between the events, we advocate the use of Linear-time Temporal Logic (LTL) (see Table4 ). By using LTL for the speci- cation of behavior, we can bene t from the well-known solutions for constructing test oracles.... ..."

Cited by 8

### Table 2: Temporal Logic Benchmarks

1997

"... In PAGE 14: ... The programs used are essentially those given there (adapted for the UTVPI and FD solvers), using the \shared-track quot; knowledge base (temp-st-*). Results are given in Table2 . No system has a clear advantage on these problems, with ECLiPSe being faster on one problem and the UTVPI solver being faster on two.... ..."

Cited by 15

### Table 1: Linear Temporal Logic Operators

"... In PAGE 1: ... If more than one proposition is true, they are written between parentheses. Table1 lists the usual LTL operators with example and counter example traces. Table 1: Linear Temporal Logic Operators ... ..."

### Table 4. Comparison of tools and supported temporal logics.

"... In PAGE 11: ...) Which tools may be applied at all for a given type of question depends on the temporal logic it provides. Table4 gives a comparison of the model checkers in use and the versions of logics provided. Which tools should be applied in which order depends on the analytical methods they are based on.... ..."

### Table 1. Model checking the main temporal logics

"... In PAGE 34: ...Ph. Schnoebelen 6 The two parameters of model checking Table1 that concludes Section 3.3 shows that model checking CTL formulae is much easier than model checking LTL formulae, so that it seems CTL is perhaps the better choice when it comes to picking a temporal logic in which to state behavioral properties.... In PAGE 36: ...TL formulae. There is a parallel here with the results from Section 3.1 where we saw that model checking for these three logics can be done in time that linearly depends on jSj. Finally, Table1 is not a fair comparison of the relative merits of CTL and LTL 25. 7 The complexity of symbolic model checking We already observed that, in practical situations, model checking mostly has to deal with large Kripke structures and small temporal formulae.... ..."

### Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect

2003

Cited by 1

### Tableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect

2003

Cited by 1