Optimal Direct Translation from Past Linear Temporal Logic to Deterministic Rabin Automata

The paper presents an asymptotically optimal direct translation from past linear temporal logic (pLTL) to deterministic Rabin automata, avoiding the intermediate step of constructing nondeterministic automata.