Property Directed Reachability for Generalized Petri Nets

08/05/2022
by   Nicolas Amat, et al.
0

We propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method. We actually define three different versions, that vary depending on the method used for abstracting possible witnesses, and that are able to handle problems of increasing difficulty. We have implemented our methods in a model-checker called SMPT and give empirical evidences that our approach can handle problems that are difficult or impossible to check with current state of the art tools.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2023

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets

SMPT (for Satisfiability Modulo Petri Net) is a model checker for reacha...
research
10/09/2019

Generalized Property-Directed Reachability for Hybrid Systems

Generalized property-directed reachability (GPDR) belongs to the family ...
research
06/10/2020

Checking marking reachability with the state equation in Petri net subclasses

Although decidable, the marking reachability problem for Petri nets is w...
research
03/27/2022

The Lattice-Theoretic Essence of Property Directed Reachability Analysis

We present LT-PDR, a lattice-theoretic generalization of Bradley's prope...
research
09/19/2023

On the Realisability of Chemical Pathways

The exploration of pathways and alternative pathways that have a specifi...
research
10/15/2020

Directed Reachability for Infinite-State Systems

Numerous tasks in program analysis and synthesis reduce to deciding reac...
research
06/02/2023

Automated Polyhedral Abstraction Proving

We propose an automated procedure to prove polyhedral abstractions for P...

Please sign up or login with your details

Forgot password? Click here to reset