On the translation of automata to linear temporal logic
From MaRDI portal
Publication:6181926
DOI10.1007/978-3-030-99253-8_8arXiv2201.10267OpenAlexW4225931064MaRDI QIDQ6181926
Karoliina Lehtinen, Salomon Sickert, Udi Boker
Publication date: 23 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.10267
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the expressive power of temporal logic for infinite words
- Finite automata and unary languages
- Succinct representation of regular languages by Boolean automata
- On the expressive power of temporal logic
- LTL is closed under topological closure
- First-order logic with two variables and unary temporal logic
- Complementing two-way finite automata
- Temporal logic can be more expressive
- Weak alternating automata are not that weak
- The Quest for a Tight Translation of Büchi to co-Büchi Automata
- On the Krohn-Rhodes Cascaded Decomposition Theorem
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Alternation
- A combinatorial approach to the theory of ω-automata
- Application of model theoretic games to discrete linear orders and finite automata
- Star-free regular sets of ω-sequences
- Past, Present, and Infinite Future
- Two-way automata and length-preserving homomorphisms
- Backward Deterministic Büchi Automata on Infinite Words
- An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
- Characterization of temporal property classes
- Why These Automata Types?
- Büchi Complementation Made Tight
- Mathematical Foundations of Computer Science 2003
This page was built for publication: On the translation of automata to linear temporal logic
