An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

DOI10.1145/3373718.3394743OpenAlexW3023211140WikidataQ130836271 ScholiaQ130836271MaRDI QIDQ5145684FDOQ5145684

Javier Esparza, Salomon Sickert

Publication date: 21 January 2021

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

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

zbMATH Keywords

normal formlinear temporal logicdeterministic automataweak alternating automata

Mathematics Subject Classification ID

Temporal logic (03B44) Computer science (68-XX)

Cited In (3)

• A simple rewrite system for the normalization of linear temporal logic
• Back to the future: a fresh look at linear temporal logic
• On the translation of automata to linear temporal logic

Uses Software

• Isabelle/HOL
• Archive Formal Proofs
• Owl

This page was built for publication: An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145684)