Efficient First-Order Temporal Logic for Infinite-State Systems

Details Efficient First-Order Temporal Logic for Infinite-State Systems Efficient First-Order Temporal Logic for Infinite-State Systems

2007-02-06

arxiv.org/abs/cs/0702036v1

Computer Science

Logic in Computer Science

16 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient First-Order Temporal Logic for Infinite-State Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient First-Order Temporal Logic for Infinite-State Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient First-Order Temporal Logic for Infinite-State Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427073