Volume 1254 of the series Lecture Notes in Computer Science pp 279290
Efficient detection of vacuity in ACTL formulas
 Ilan BeerAffiliated withHaifa Research Laboratory, IBM Science and Technology
 , Shoham BenDavidAffiliated 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
Abstract
Prepositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially because the precondition of the implication is not satisfiable. In other words, the postcondition 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 wACTL, a subset of CTL and show by construction that for every wACTL formula ϕ there is a formula w(ϕ), such that: both ϕ and w(ϕ) are true in some model M iff ϕ passes vacuously. A useful sideeffect of w(ϕ) is that if false, any counterexample is also a nontrivial witness of the original formula ϕ.
 Title
 Efficient detection of vacuity in ACTL formulas
 Book Title
 Computer Aided Verification
 Book Subtitle
 9th International Conference, CAV'97 Haifa, Israel, June 22–25, 1997 Proceedings
 Pages
 pp 279290
 Copyright
 1997
 DOI
 10.1007/3540631666_28
 Print ISBN
 9783540631668
 Online ISBN
 9783540691952
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1254
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Ilan Beer ^{(1)}
 Shoham BenDavid ^{(1)}
 Cindy Eisner ^{(1)}
 Yoav Rodeh ^{(1)}
 Author Affiliations

 1. Haifa Research Laboratory, IBM Science and Technology, Matam, Haifa, Israel
Continue reading...
To view the rest of this content please follow the download PDF link above.