Critical trees: counterexamples in model checking of CSM systems using CBS algorithm

10/26/2017
by   Wiktor B. Daszczuk, et al.
0

The important feature of temporal model checking is the generation of counterexamples. In the report, the requirements for generation of counterexample (called critical tree) in model checking of CSM systems are described. The output of TempoRG model checker for QsCTL logic (a version of CTL) is presented. A contradiction between counterexample generation and state space reduction is commented.

READ FULL TEXT

page 15

page 16

research
03/11/2019

Model Checking ATL* on vCGS

We prove that the model checking ATL* on concurrent game structures with...
research
04/10/2014

Verification of confliction and unreachability in rule-based expert systems with model checking

It is important to find optimal solutions for structural errors in rule-...
research
11/16/2018

Quantifying Attacker Capability Via Model Checking Multiple Properties (Extended Version)

This work aims to solve a practical problem, i.e., how to quantify the r...
research
03/22/2022

Reduction of Register Pushdown Systems with Freshness Property to Pushdown Systems in LTL Model Checking

Pushdown systems (PDS) are known as an abstract model of recursive progr...
research
07/27/2019

Combining closed-loop test generation and execution by means of model checking

Model checking is an established technique to formally verify automation...
research
07/11/2022

Counterexample Generation for Infinite-State Chemical Reaction Networks

Counterexample generation is an indispensable part of model checking pro...
research
11/20/2020

Experiences from Large-Scale Model Checking: Verification of a Vehicle Control System

In the age of autonomously driving vehicles, functionality and complexit...

Please sign up or login with your details

Forgot password? Click here to reset