Abstract
We provide an effective characterization of the “until-since hierarchy” of linear temporal logic over finite models (strings), that is, we show how to compute for a given temporal property of strings the minimal nesting depth in “until” and “since” required to express it. This settles the most prominent classification problem for linear temporal logic. Our characterization of the individual levels of the “until-since hierarchy” is algebraic: for each n, we present a decidable class of finite semigroups and show that a temporal property is expressible with nesting depth at most n if and only if the syntactic semigroup of the formal language associated with the property belongs to the class provided. The core of our algebraic characterization is a new description of substitution in linear temporal logic in terms of block products of finite semigroups.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Thérien, D., Wilke, T. Nesting Until and Since in Linear Temporal Logic. Theory Comput Systems 37, 111–131 (2004). https://doi.org/10.1007/s00224-003-1109-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-003-1109-3