User-Driven Abstraction for Model Checking

07/28/2023
by   Glenn Bruns, et al.
0

Model checking has found a role in the engineering of reactive systems. However, model checkers are still strongly limited by the size of the system description they can check. Here we present a technique in which a system is simplified prior to model checking by the application of abstraction rules. The rules can greatly reduce the state space of a system description and help in understanding why a system satisfies a property. We illustrate the use of the technique on examples, including Dekker's mutual exclusion algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2019

Model Checking ATL* on vCGS

We prove that the model checking ATL* on concurrent game structures with...
research
11/03/2021

Fair Mutual Exclusion for N Processes (extended version)

Peterson's mutual exclusion algorithm for two processes has been general...
research
02/24/2022

Practical Abstraction for Model Checking of Multi-Agent Systems

Model checking of multi-agent systems (MAS) is known to be hard, both th...
research
10/28/2021

A GNN Based Approach to LTL Model Checking

Model Checking is widely applied in verifying complicated and especially...
research
12/21/2020

Bounded Model Checking of Software Using Interval Methods via Contractors

Bounded model checking (BMC) is a vital technique to find property viola...
research
07/23/2023

Robustness, model checking and latent Gaussian models

Model checking is essential to evaluate the adequacy of statistical mode...
research
09/29/2020

Computing and Proving Well-founded Orderings through Finite Abstractions

A common technique for checking properties of complex state machines is ...

Please sign up or login with your details

Forgot password? Click here to reset