Multi-Valued Model Checking via Classical Model Checking
نویسندگان
چکیده
Multi-valued model-checking is an extension of classical model-checking to reasoning about systems with uncertain information, which are common during early design stages. The additional values of the logic are used to capture the degree of uncertainty. In this paper, we show that the multi-valued -calculus model-checking problem is reducible to several classical model-checking problems. The reduction allows one to reuse existing model-checking tools and algorithms to solve multi-valued model-checking problems. This paper generalizes, extends and corrects previous work in this area, done in the context of 3-valued models, symbolic model-checking, and De Morgan algebras.
منابع مشابه
Model-Checking of Linear-Time Properties in Multi-Valued Systems
In this paper, we study model-checking of linear-time properties in multi-valuedsystems. Safety property, invariant property, liveness property, persistence anddual-persistence properties in multi-valued logic systems are introduced. Somealgorithms related to the above multi-valued linear-time properties are discussed.The verification of multi-valued regular safety properties an...
متن کاملAn Introduction to Multi-Valued Model Checking
Nowadays computer systems have become ubiquitous. Most of the resources in the development of such systems, and especially in the fail-safe ones, are allocated into the simulation and verification of their behavior. One such automated method of verification is model checking. Given a mathematical description of the real system and a specification usually in the form of temporal logics, a model ...
متن کاملAutomated Paraconsistent Reasoning via Model Checking
Inconsistency is a pervasive problem in software engineering, where different aspects of a system are described in separate models. Resolving all the inconsistencies in a large set of models is often infeasible, in which case automated reasoning tools based on classical logic have limited application. In this paper we describe an automated tool for paraconsistent reasoning, using multi-valued l...
متن کاملEfficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Multi-valued Model Checking extends classical, twovalued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued one...
متن کاملA Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional information such as incompleteness, uncertainty, and many others, but with the cost of time and space complexity. This paper addresses this problem, and proposes a new algorithm for Multi-valued Model Checking. While Chechi...
متن کامل