A simple rewrite system for the normalization of linear temporal logic

DOI10.1007/978-3-031-22337-2_10zbMath1528.68159arXiv2304.08872OpenAlexW4312791991MaRDI QIDQ6113977

Javier Esparza, Rubén Rubio, Salomon Sickert

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Temporal logic (03B44)

Cites Work

• Unnamed Item
• The temporal semantics of concurrent programs
• Completing the temporal picture
• Temporal Logic and Fair Discrete Systems
• On the Krohn-Rhodes Cascaded Decomposition Theorem
• A Unified Translation of Linear Temporal Logic to ω-Automata
• An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
• Characterization of temporal property classes
• Mathematical Foundations of Computer Science 2003
• Implementation and Application of Automata
• Owl: a library for \(\omega \)-words, automata, and LTL
• On the translation of automata to linear temporal logic

This page was built for publication: A simple rewrite system for the normalization of linear temporal logic