29 citations · 58 across the 9 of their papers we have counts for
5 papers · 1 filter
Accelerating the Computation of Dead and Concurrent Places using Reductions
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan
We propose a new method for accelerating the computation of a concurrency relation, that is all pairs of places in a Petri net that can be marked together. Our approach relies on a…
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…
A State Class Construction for Computing the Intersection of Time Petri Nets Languages
Yannick Pencolé, Éric Lubat, Silvano Dal Zilio +2
We propose a new method for computing the language intersection of two Time Petri nets (TPN); that is the sequence of labels in timed traces common to the execution of two TPN. Our…
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…
A Verified Approach for Checking Real-Time Specification Patterns
Nouha Abid, Silvano Dal Zilio, Didier Le Botlan
We propose a verified approach to the formal verification of timed properties using model-checking techniques. We focus on properties expressed using real-time specification patter…