Temporal logics on strings with prefix relation

  title={Temporal logics on strings with prefix relation},
  author={St{\'e}phane Demri and Morgan Deters},
  journal={J. Log. Comput.},
We show that linear-time temporal logic over concrete domains made of finite strings and the prefix relation admits a PSpace-complete satisfiability problem. Actually, we extend a known result with the concrete domain made of the set of natural numbers and the greater than relation (corresponding to the singleton alphabet case) and we solve an open problem mentioned in several publications. Since the prefix relation is not a total ordering, it is not possible to take advantage of existing… CONTINUE READING


Publications citing this paper.

Similar Papers

Loading similar papers…