Temporal logic with predicate abstraction
| dc.creator | Lisitsa, Alexei | |
| dc.creator | Potapov, Igor | |
| dc.date | 2004-10-27 | |
| dc.date.accessioned | 2026-07-25T16:51:13Z | |
| dc.description | A predicate linear temporal logic LTL_{λ,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{λ,=} can be naturally seen as the systems of pebbles (flexible constants) moving over the elements of some (possibly infinite) domain. This allows to use LTL_{λ,=} 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 LTL_{λ,=} is not recursively axiomatizable and, therefore, fully automated verification of LTL_{λ,=} specifications is not, in general, possible. | |
| dc.description | 14 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0410072 | |
| dc.identifier | http://arxiv.org/abs/cs/0410072 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/43599 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computation and Language | |
| dc.subject | F.1.1; F.3.1; F.4.1; F.4.3 | |
| dc.title | Temporal logic with predicate abstraction | |
| dc.type | text |