Efficient First-Order Temporal Logic for Infinite-State Systems
| dc.creator | Dixon, Clare | |
| dc.creator | Fisher, Michael | |
| dc.creator | Konev, Boris | |
| dc.creator | Lisitsa, Alexei | |
| dc.date | 2007-02-06 | |
| dc.date.accessioned | 2026-07-07T07:45:00Z | |
| dc.date.available | 2026-07-07T07:45:00Z | |
| dc.description | In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variety of first-order temporal logic that is both powerful enough for this form of specification and tractable enough for practical deductive verification. Importantly, the power of the temporal language allows us to describe (and verify) asynchronous systems, communication delays and more complex properties such as liveness and fairness properties. These aspects appear difficult for many other approaches to infinite-state verification. | |
| dc.description | 16 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0702036 | |
| dc.identifier | http://arxiv.org/abs/cs/0702036 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/123399 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1; F.3.1; D.2.2; D.2.4 | |
| dc.title | Efficient First-Order Temporal Logic for Infinite-State Systems | |
| dc.type | text |