4 citations · 6 across the 4 of their papers we have counts for
3 papers · 1 filter
Checking marking reachability with the state equation in Petri net subclasses
Thomas Hujsa, Bernard Berthomieu, Silvano Dal Zilio +1
Although decidable, the marking reachability problem for Petri nets is well-known to be intractable in general, and a non-elementary lower bound has been recently uncovered. In ord…
Petri Net Reductions for Counting Markings
Bernard Berthomieu, Didier Le Botlan, Silvano Dal Zilio
We propose a method to count the number of reachable markings of a Petri net without having to enumerate these rst. The method relies on a structural reduction system that reduces…
An Experiment on Parallel Model Checking of a CTL Fragment
Rodrigo Tacla Saad, Silvano Dal Zilio, Bernard Berthomieu
We propose a parallel algorithm for local, on the fly, model checking of a fragment of CTL that is well-suited for modern, multi-core architectures. This model-checking algorithm t…