### Table I. Known Results for RSMs Without Recursion Class of RSM Reachability Cycle Detection LTL CTL

### Table I. Known Results for RSMs Without Recursion Class of RSM Reachability Cycle Detection LTL CTL

### Table 2. Model checking fragments of LTL (= L(U; X))

### Table 2: FQL expressions with equivalent LTL+ Formulae

"... In PAGE 6: ... Table 1 gives a representative listing of those FQL expressions which admit of equivalent LTL formulae. Table2 is a representative listing of those FQL macros which admit of no equivalent LTL formulae, and their equivalent LTL+ formulae. We will determine which of those FQL macros from Tables 1 and 2 admit of equivalent CTL or CTL+ Formulae.... ..."

### Table 1: FQL expressions admitting of equivalent LTL Formulae

"... In PAGE 6: ...) 5 FQL With Equivalent CTL+ Formulae It can be proved that no FQL expression with both enabling and discharging conditions admits of an equivalent CTL or LTL formula; on the other hand, every FQL expression does have an equivalent LTL+ formula [2]. Table1 gives a representative listing of those FQL expressions which admit of equivalent LTL formulae. Table 2 is a representative listing of those FQL macros which admit of no equivalent LTL formulae, and their equivalent LTL+ formulae.... In PAGE 6: ... Translation for some LTL formulae are obvious. For each of the LTL formulae: Gf, G(:f), Ff, fUd, and fU(f d) , A is already a CTL formula, and thus the corresponding FQL macro ( Table1 ) has an equivalent CTL formula. Kupferman and Grunberg [9] showed that the CTL2 formula EG( 1U 2) embodies all the expressive superiority of CTL2 over CTL.... In PAGE 6: ... They provided rules for translating to equivalent CTL formulae all CTL2 formulae which do not contain EG( 1U 2). Table 3 gives those LTL formulae form Table1 whose corre- sponding CTL formulae A apos;s belong to CTL2, and thus the above result applies, giving rise to the listed CTL formulae.... ..."

### Table 1. Comparing model checking approaches for various LTL properties.

1999

"... In PAGE 10: ... This gives us a means to contrast our decision procedure against the CTL decision procedure. The results can be found in Table1 . The leftmost column gives the model and the type of property.... ..."

Cited by 37

### Table 6 contrasts the cost of model checking with that of symbolic model checking. It provides one more argument against the view that model check- ing is easier for CTL than for LTL.

"... In PAGE 39: ...39 model checking symbolic model checking LTL PSPACE-complete PSPACE-complete CTL P-complete PSPACE-complete CTL PSPACE-complete PSPACE-complete Table6 . Contrasting symbolic and non-symbolic model checking algorithms (e.... ..."