7

PhD Thesis: A polyhedral Framework for Reachability Problems in Petri Nets

We propose and study a method to accelerate the verification of reachability problems in Petri nets based on structural reductions. This approach, that we call polyhedral reduction, relies on a state space abstraction that combines structural …

Master thesis: A New Approach for the Symbolic Model Checking of Petri nets

The Vertics team at LAAS-CNRS has been developing a new approach for the symbolic model checking for years, i.e., a method to represent exactly the state-space of a system without enumerating it exhaustively. This study's originality consists in the …