Log In Sign Up

Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic

by   Normann Decker, et al.

This paper presents an approximation approach to verifying counter systems with respect to properties formulated in an expressive counting extension of linear temporal logic. It can express, e.g., that the number of acknowledgements never exceeds the number of requests to a service, by counting specific positions along a run and imposing arithmetic constraints. The addressed problem is undecidable and therefore solved on flat under-approximations of a system. This provides a flexibly adjustable trade-off between exhaustiveness and computational effort, similar to bounded model checking. Recent techniques and results for model-checking frequency properties over flat Kripke structures are lifted and employed to construct a parametrised encoding of the (approximated) problem in quantifier-free Presburger arithmetic. A prototype implementation based on the z3 SMT solver demonstrates the effectiveness of the approach based on problems from the RERS Challange.


From Quantified CTL to QBF

QCTL extends the temporal logic CTL with quantifications over atomic pro...

QCTL model-checking with QBF solvers

Quantified CTL (QCTL) extends the temporal logic CTL with quantification...

Approximate Evaluation of First-Order Counting Queries

Kuske and Schweikardt introduced the very expressive first-order countin...

Verification of Flat FIFO Systems

The decidability and complexity of reachability problems and model-check...

CTL* model checking for data-aware dynamic systems with arithmetic

The analysis of complex dynamic systems is a core research topic in form...

Model Checking Quantitative Hyperproperties

Hyperproperties are properties of sets of computation traces. In this pa...

Soundness of Data-Aware Processes with Arithmetic Conditions

Data-aware processes represent and integrate structural and behavioural ...