Learn More
Temporal logics like LTL are frequently used for the specification and verification of reac-tive systems. To this end, LTL formulas are typically translated to nondeterministic Büchi automata so that the LTL verification problem is reduced to a nonemptiness problem of ω-automata. While nondeterministic automata are sufficient for this purpose, many other(More)
  • 1