New Frontiers for Linear Temporal Logic


We describe a new algorithm for proving linear temporal properties of infinite-state systems. Our approach takes advantage of the fact that branching-time proof methods can sometimes be used to prove linear-time properties more efficiently than standard lineartime techniques can. The caveat is that, in certain instances, nondeterminism in the transition relation can cause branching-time methods to report counterexamples that are spurious in the linear-time semantics. To address this problem we describe an algorithm that, as it attempts to apply branching-time proof methods, finds and then removes problematic non-determinism via an analysis on the spurious counterexamples. Problematic nondeterminism is characterized using predicates, and removed using a predicate-based partial determinization procedure. We demonstrate that our method can yield orders of magnitude performance improvements over native linear-time methods. 1

Similar works

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.