2006Unpublished venueRequires access

Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic

Jian Guo

Open publisher page 3 citations

Abstract

Model checking is one of the attracting methods in formal verification,but the main disadvantage of model checking is the state explosion that might occur if the system being verified becomes larger.This paper presents a method of abstracting a system and setting up an incomplete state model,Partial Kripke Structure,upon which proper- ties of the system is verified.Under such a structure,a 3-valued interpretation to CTL logic formulae is given,with a third truth value unknown(⊥),which means“true or false unknown”.A 3-valued CTL model checking algorithm based on partial Kripke structure is also provided.Compared with 2-valued model checking technique,the algorithm does not increase the time complexity.At last some applications of 3-valued logic model checking are addressed.

About this research paper

What this paper is about

Model checking is one of the attracting methods in formal verification,but the main disadvantage of model checking is the state explosion that might occur if the system being verified becomes larger.This paper presents a method of abstracting a system and setting up an incomplete state model,Partial Kripke Structure,upon which proper- ties of the system is verified.Under such a structure,a 3-valued interpretation to CTL logic formulae is given,with a third truth value unknown(⊥),which means“true or false unknown”.A 3-valued CTL model checking algorithm based on partial Kripke structure is also provided.Compared with 2-valued model checking technique,the algorithm does not increase the time complexity.At last some applications of 3-valued logic model checking are addressed.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Model checking is one of the attracting methods in formal verification,but the main disadvantage of model checking is the state explosion that might occur if the system being verified becomes larger.This paper presents a method of abstracting a system and setting up an incomplete state model,Partial Kripke Structure,upon which proper- ties of the system is verified.Under such a structure,a 3-valued interpretation to CTL logic formulae is given,with a third truth value unknown(⊥),which means“true or false unknown”.A 3-valued CTL model checking algorithm based on partial Kripke structure is also provided.Compared with 2-valued model checking technique,the algorithm does not increase the time complexity.At last some applications of 3-valued logic model checking are addressed.

Key concepts: Kripke structure, Model checking, Computer science, Computation tree logic, Temporal logic, Abstraction model checking, CTL*, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic — Research Paper | ScholarLens