Nesting until and since in linear temporal logic

DOI10.1007/s00224-003-1109-3zbMath1130.03014OpenAlexW1978605527MaRDI QIDQ705066

Thomas Wilke, Denis Thérien

Publication date: 25 January 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1109-3

zbMATH Keywords

formal languageblock products of finite semigroupsdecidable classlinear temporal logic over finite modelssyntactic semigroupuntil-since hierarchy

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60) Semigroups in automata theory, linguistics, etc. (20M35) Temporal logic (03B44)

Related Items (5)

Limiting Until in Ordered Tree Query Languages ⋮ A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS ⋮ WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY ⋮ A Language-Theoretical Approach to Descriptive Complexity ⋮ Regular Languages Definable by Majority Quantifiers with Two Variables

This page was built for publication: Nesting until and since in linear temporal logic