On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets

by   Nicolas Amat, et al.

We define a method for taking advantage of net reductions in combination with a SMT-based model checker. We prove the correctness of this method using a new notion of equivalence between nets that we call polyhedral abstraction. Our approach has been implemented in a tool, named SMPT, that provides two main procedures: Bounded Model Checking (BMC) and Property Directed Reachability (PDR). Each procedure has been adapted in order to use reductions and to work with arbitrary Petri nets. We tested SMPT on a large collection of queries used during the 2020 edition of the Model Checking Contest. Our experimental results show that our approach works well, even when we only have a moderate amount of reductions.



There are no comments yet.


page 1

page 2

page 3

page 4


Accelerating the Computation of Dead and Concurrent Places using Reductions

We propose a new method for accelerating the computation of a concurrenc...

Methods for Efficient Unfolding of Colored Petri Nets

Colored Petri nets offer a compact and user friendly representation of t...

LTL under reductions with weaker conditions than stutter-invariance

Verification of properties expressed as-regular languages such as LTL ca...

MCC: a Tool for Unfolding Colored Petri Nets in PNML Format

MCC is a tool designed for a very specific task: to transform the models...

Skeleton Abstraction for Universal Temporal Properties

Uniform coloured Petri nets can be abstracted to their skeleton, the pla...

Proposal for Adding Useful Features to Petri-Net Model Checkers

Solutions proposed for the longstanding problem of automatic decompositi...

Global Guidance for Local Generalization in Model Checking

SMT-based model checkers, especially IC3-style ones, are currently the m...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.