Chapter

Computer Aided Verification

Volume 1254 of the series Lecture Notes in Computer Science pp 279-290

Date:

Efficient detection of vacuity in ACTL formulas

  • Ilan BeerAffiliated withHaifa Research Laboratory, IBM Science and Technology
  • , Shoham Ben-DavidAffiliated withHaifa Research Laboratory, IBM Science and Technology
  • , Cindy EisnerAffiliated withHaifa Research Laboratory, IBM Science and Technology
  • , Yoav RodehAffiliated withHaifa Research Laboratory, IBM Science and Technology

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Prepositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially because the pre-condition of the implication is not satisfiable. In other words, the post-condition of the implication does not affect the truth value of the formula. We call this a vacuous pass, and extend the definition of vacuity to cover other kinds of trivial passes in temporal logic. We define w-ACTL, a subset of CTL and show by construction that for every w-ACTL formula ϕ there is a formula w(ϕ), such that: both ϕ and w(ϕ) are true in some model M iff ϕ passes vacuously. A useful side-effect of w(ϕ) is that if false, any counter-example is also a non-trivial witness of the original formula ϕ.