How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata

@inproceedings{Snchez2012HowTE,
  title={How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata},
  author={C{\'e}sar S{\'a}nchez and Juli{\'a}n Samborski-Forlese},
  year={2012}
}
This paper presents studies efficient and general translations of extensions of linear temporal logic (LTL) into alternating automata, which can be applied to improve algorithms for the automata-theoretic approach to model-checking. In particular, we introduce—using a game theoretic framework—a novel finer grain complementation theorem for the parity… CONTINUE READING