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

DOI10.1145/3373718.3394743MaRDI QIDQ5145684zbMATH OpenOpenAlexWikidataFDO

Authors Salomon Sickert, Javier Esparza

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

Describes a project that uses

Uses Software

• Owl
• Archive Formal Proofs
• Isabelle/HOL

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)