LTL over integer periodicity constraints

@article{Demri2006LTLOI,
  title={LTL over integer periodicity constraints},
  author={St{\'e}phane Demri},
  journal={Theor. Comput. Sci.},
  year={2006},
  volume={360},
  pages={96-123}
}
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although the underlying constraint language is a fragment of Presburger arithmetic shown to admit a pspace… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS