Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics

Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions generated by automatic techniques such as preditraction. Indeed, for the same cost, model checking three-valued abstractions can be used to both prove and disprove any temporal-logic property, whereas traditional cone abstractions can only prove universal properties. Also, verification results can be more precise with generalized model checking, which checks whether there exists a zation of an abstraction satisfying a temporal-logic formula. Since generalized model checking includes satisfiability as a special case (when everything in the model is unknown), it is in general more expensive than traditional model checking. In this paper, we study how to reduce generalized model checking to model checking by a temporallogic formula transformation, which generalizes a transformation for propositional logic known...

• Type: Conference
• Year: 2005
• Where: LICS
• Authors: Patrice Godefroid, Michael Huth
• Keywords: Abstraction, Computer Science, LICS 2005, Model Checking, Traditional Model Checking