Generating Counterexamples for Multi-valued Model-Checking [chapter]

Arie Gurfinkel, Marsha Chechik
2003 Lecture Notes in Computer Science  
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model-checking, introduced in [4] is an extension of classical model-checking. Instead of classical logic, it operates on elements of a given De Morgan algebra, e.g. the Kleene algebra [14] . Multi-valued modelchecking has been used in a number of applications, primarily when reasoning about partial [2] and inconsistent
more » ... ] systems. In this paper we show how to generate counterexamples for multi-valued model-checking. We describe the proof system for a multi-valued variant of CTL, discuss how to use it to generate counterexamples. The techniques presented in this paper have been implemented as part of our symbolic multi-valued model-checker χ Chek [3].
doi:10.1007/978-3-540-45236-2_28 fatcat:zpfosbpgzfdy3amdzwvdjp7j7i