Yet Another Look at LTL Model Checking ⋆

  title={Yet Another Look at LTL Model Checking ⋆},
  author={Klaus Schneider},
A subset of LTL is presented that can be translated to ω-automata with only a linear number of states. The translation is completel y based on closures under temporal and boolean operators. Moreover, it is shown how this enhancement can be combined with traditional translations so that a ll LTL formulas can be translated. Exponential savings are possible in terms of reachable states, as well as in terms of runtime and memory requirements for model ch cking.