DeepAI AI Chat
Log In Sign Up

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets

by   Nicolas Amat, et al.

SMPT (for Satisfiability Modulo Petri Net) is a model checker for reachability problems in Petri nets. It started as a portfolio of methods to experiment with symbolic model checking, and was designed to be easily extended. Some distinctive features are its ability to benefit from structural reductions and to generate verdict certificates. Our tool is quite mature and performed well compared to other state-of-the-art tools in the Model Checking Contest.


page 1

page 2

page 3

page 4


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

We define a method for taking advantage of net reductions in combination...

Property Directed Reachability for Generalized Petri Nets

We propose a semi-decision procedure for checking generalized reachabili...

Model Checking ofWorkflow Nets with Tables and Constraints

Many operations in workflow systems are dependent on database tables. Th...

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...

Methods for Efficient Unfolding of Colored Petri Nets

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

Symbolic Analysis and Parameter Synthesis for Time Petri Nets Using Maude and SMT Solving

Parametric time Petri nets with inhibitor arcs (PITPNs) support flexibil...

Proposal for Adding Useful Features to Petri-Net Model Checkers

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