research
∙
06/02/2023
Automated Polyhedral Abstraction Proving
We propose an automated procedure to prove polyhedral abstractions for P...
share
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
∙
02/06/2023
Leveraging polyhedral reductions for solving Petri net reachability problems
We propose a new method that takes advantage of structural reductions to...
research
∙
08/05/2022
Property Directed Reachability for Generalized Petri Nets
We propose a semi-decision procedure for checking generalized reachabili...
research
∙
06/24/2021
Accelerating the Computation of Dead and Concurrent Places using Reductions
We propose a new method for accelerating the computation of a concurrenc...
research
∙
04/20/2021
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...
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
∙
05/11/2020
On the Petri Nets with a Single Shared Place and Beyond
Petri nets proved useful to describe various real-world systems, but man...
research
∙
03/20/2020
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...
research
∙
01/31/2020
Formal Approach for the Verification of Onboard Autonomous Functions in Observation Satellites
We propose a new approach for modelling the functional behaviour of an E...
research
∙
08/06/2019
A State Class Construction for Computing the Intersection of Time Petri Nets Languages
We propose a new method for computing the language intersection of two T...
research
∙
07/09/2018
Petri Net Reductions for Counting Markings
We propose a method to count the number of reachable markings of a Petri...
research
∙
05/17/2018