Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness

DOI10.1109/LICS.2013.25zbMath1366.03185OpenAlexW1975710334MaRDI QIDQ5271056

Angelo Montanari, Pietro Sala

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.25

zbMATH Keywords

complexitydecidabilityinterval temporal logicextension of omega languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items

Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) ⋮ Metric propositional neighborhood logic with an equivalence relation ⋮ An interval temporal logic characterization of extended \(\omega\)-regular languages ⋮ Unnamed Item ⋮ Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts ⋮ On a Temporal Logic of Prefixes and Infixes. ⋮ Reactive synthesis from interval temporal logic specifications