An interval temporal logic characterization of extended -regular languages

DOI10.1016/J.TCS.2023.113929MaRDI QIDQ6159024zbMATH OpenOpenAlexFDO

Authors Dario Della Monica, Angelo Montanari, Pietro Sala

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

\(\omega\)-regular expressionsexpressivenesstemporal logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Interval logics and B-regular languages
• Beyond -regular languages: T-regular expressions and their automata and logic counterparts
• Beyond BS-regular languages: T-regular expressions and counter-check automata
• scientific article; zbMATH DE number 3989329
• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions

Cites work

• A propositional modal logic of time intervals
• Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness
• Beyond -regular languages: T-regular expressions and their automata and logic counterparts
• Boundedness in languages of infinite words
• Computer Science Logic
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers
• scientific article; zbMATH DE number 1696444 (Why is no real title available?)
• scientific article; zbMATH DE number 3862427 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Interval logics and B-regular languages
• Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
• Maintaining knowledge about temporal intervals
• Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
• Testing and generating infinite sequences by a finite automaton
• The importance of the past in interval temporal logics: the case of propositional neighborhood logic
• Weak MSO with the unbounding quantifier

Cited in

(2)

• An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
• Propositional Projection Temporal Logic, B $\ddot{u}$ chi Automata and ω-Regular Expressions

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

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