Symbolic Model Checking for Propositional Projection Temporal Logic

2012 ◽  
Author(s):  
Tao Pang ◽  
Zhenhua Duan ◽  
Cong Tian
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Symbolic Model Checking ◽  
Symbolic Model

scholarly journals Unbounded Model Checking for ATL

2021 ◽  
Author(s):  
Michał Kański ◽  
Artur Niewiadomski ◽  
Magdalena Kacprzak ◽  
Wojciech Penczek ◽  
Wojciech Nabiałek
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Symbolic Model Checking ◽  
Experimental Results ◽  
Multi Agent Systems ◽  
Symbolic Model ◽  
Agent Systems ◽  
Multi Agent

In this paper, we deal with verification of multi-agent systems represented as concurrent game structures. To express properties to be verified, we use Alternating-Time Temporal Logic (ATL) formulas. We provide an implementation of symbolic model checking for ATL and preliminary, but encouraging experimental results.

scholarly journals Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Rui Wang ◽  
Wanwei Liu ◽  
Tun Li ◽  
Xiaoguang Mao ◽  
Ji Wang
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Bounded Model Checking ◽  
Symbolic Model Checking ◽  
Model Checker ◽  
Symbolic Model ◽  
Complementary Technique

As a complementary technique of the BDD-based approach, bounded model checking (BMC) has been successfully applied to LTL symbolic model checking. However, the expressiveness of LTL is rather limited, and some important properties cannot be captured by such logic. In this paper, we present a semantic BMC encoding approach to deal with the mixture ofETLfandETLl. Since such kind of temporal logic involves both finite and looping automata as connectives, all regular properties can be succinctly specified with it. The presented algorithm is integrated into the model checker ENuSMV, and the approach is evaluated via conducting a series of imperial experiments.

Sign in / Sign up

Export Citation Format

Share Document