Temporal logic with predicate abstraction

@article{Lisitsa2004TemporalLW,
  title={Temporal logic with predicate abstraction},
  author={Alexei Lisitsa and Igor Potapov},
  journal={CoRR},
  year={2004},
  volume={cs.LO/0410072}
}
A predicate linear temporal logic without quantifiers but with predicate -abstraction mechanism and equality is considered. The models of can be naturally seen as the systems of pebbles (flexible constants) moving over the elements of some (possibly infinite) domain. This allows to use for the specification of dynamic systems using some resources, such as processes using memory locations, mobile agents occupying some sites, etc. On the other hand we show that is not recursively axiomatizable… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS