One Theorem to Rule Them All

DOI10.1145/3209108.3209161zbMath1497.68259arXiv1805.00748OpenAlexW4289761305MaRDI QIDQ5145312

Javier Esparza, Salomon Sickert, Jan Křetínský

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.00748

zbMATH Keywords

linear temporal logicdeterministic automataautomata over infinite wordsnondeterministic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items (9)

Determinization and limit-determinization of Emerson-Lei automata ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Index appearance record with preorders ⋮ OmegaThreads ⋮ Dissecting \texttt{ltlsynt} ⋮ Unnamed Item ⋮ Generic Emptiness Check for Fun and Profit ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Back to the future: a fresh look at linear temporal logic

Uses Software

• SPOT
• Rabinizer

This page was built for publication: One Theorem to Rule Them All