Reasoning about periodicity on infinite words

DOI10.1007/978-3-319-69483-2_12MaRDI QIDQ5045386zbMATH OpenOpenAlexFDO

Authors Wanwei Liu, Fu Song, Ge Zhou

Publication date 4 November 2022

Published in Dependable Software Engineering. Theories, Tools, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69483-2_12

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• LTL over integer periodicity constraints
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 3989329
• On the expressive power of temporal logic
• A finitary-language semantics for propositional linear temporal logic

Cited in

(3)

• Least Periods of Factors of Infinite Words
• ON THE REPETITIVITY INDEX OF INFINITE WORDS
• Foundations of Software Science and Computation Structures

This page was built for publication: Reasoning about periodicity on infinite words

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