An interval temporal logic characterization of extended \(\omega\)-regular languages

DOI10.1016/j.tcs.2023.113929OpenAlexW4376863261MaRDI QIDQ6159024

Angelo Montanari, Pietro Sala, Dario Della Monica

Publication date: 1 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113929

zbMATH Keywords

temporal logicexpressiveness\(\omega\)-regular expressions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
• Weak MSO with the unbounding quantifier
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
• The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic
• Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
• A propositional modal logic of time intervals
• Interval Logics and ωB-Regular Languages
• Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
• Computer Science Logic
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: An interval temporal logic characterization of extended \(\omega\)-regular languages