Efficient First-Order Temporal Logic for Infinite-State Systems

Dixon, Clare, Fisher, Michael, Konev, Boris ORCID: 0000-0002-6507-0494 and Lisitsa, Alexei
(2007) Efficient First-Order Temporal Logic for Infinite-State Systems.

[thumbnail of 0702036v1.pdf] Text
0702036v1.pdf - Unspecified

Download (150kB)


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.

Item Type: Article
Additional Information: 16 pages, 2 figures
Uncontrolled Keywords: cs.LO, cs.LO, F.4.1; F.3.1; D.2.2; D.2.4
Depositing User: Symplectic Admin
Date Deposited: 21 Apr 2016 09:17
Last Modified: 17 Dec 2022 02:25
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3000458