2009Unpublished venueRequires access

Symbolic Model Checking Algorithm for Temporal Epistemic Logic CTL*K

Zhixue Wang

Open publisher page 2 citations

Abstract

Temporal epistemic logics have been gradually used in specification of multiple agents system,which are composed by temporal logics and epistemic logics.Most of temporal epistemic logics are based on CTL,which have a limited expressivity.And some model checking techniques existing for them have problems such as memory-shortage and state-explosion.A temporal epistemic logic CTL*K based on CTL* was proposed.Through the definition of syntax and semantics,CTL*K had a strong expressivity and could describe agents' epistemic properties such as belief and goal.To check CTL*K,a symbolic model checking algorithm for CTL*K was offered,which translated a CTL*K formula into a common CTL* formula and could be easily encoded into NuSMV model checker.The experiment showed that the algorithm could obviously enlarge the size of system to be checked.

About this research paper

What this paper is about

Temporal epistemic logics have been gradually used in specification of multiple agents system,which are composed by temporal logics and epistemic logics.Most of temporal epistemic logics are based on CTL,which have a limited expressivity.And some model checking techniques existing for them have problems such as memory-shortage and state-explosion.A temporal epistemic logic CTL*K based on CTL* was proposed.Through the definition of syntax and semantics,CTL*K had a strong expressivity and could describe agents' epistemic properties such as belief and goal.To check CTL*K,a symbolic model checking algorithm for CTL*K was offered,which translated a CTL*K formula into a common CTL* formula and could be easily encoded into NuSMV model checker.The experiment showed that the algorithm could obviously enlarge the size of system to be checked.

Why it matters

OpenAlex reports 2 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

Temporal epistemic logics have been gradually used in specification of multiple agents system,which are composed by temporal logics and epistemic logics.Most of temporal epistemic logics are based on CTL,which have a limited expressivity.And some model checking techniques existing for them have problems such as memory-shortage and state-explosion.A temporal epistemic logic CTL*K based on CTL* was proposed.Through the definition of syntax and semantics,CTL*K had a strong expressivity and could describe agents' epistemic properties such as belief and goal.To check CTL*K,a symbolic model checking algorithm for CTL*K was offered,which translated a CTL*K formula into a common CTL* formula and could be easily encoded into NuSMV model checker.The experiment showed that the algorithm could obviously enlarge the size of system to be checked.

Key concepts: CTL*, Model checking, Computation tree logic, Computer science, Temporal logic, Syntax, Theoretical computer science, Semantics (computer science)

Related papers

Back to paper searchBrowse research topicsOriginal source
Symbolic Model Checking Algorithm for Temporal Epistemic Logic CTL*K — Research Paper | ScholarLens