18 citations · 44 across the 9 of their papers we have counts for
10 papers
Sleptsov Nets are Turing-complete
Bernard Berthomieu, Dmitry A. Zaitsev
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. R…
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking
Nicolas Amat, Bernard Berthomieu, Silvano Dal Zilio
We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some…
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…
On the Petri Nets with a Single Shared Place and Beyond
Thomas Hujsa, Bernard Berthomieu, Silvano Dal Zilio +1
Petri nets proved useful to describe various real-world systems, but many of their properties are very hard to check. To alleviate this difficulty, subclasses are often considered.…
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…
Automating the Verification of Realtime Observers using Probes and the Modal mu-calculus
Silvano Dal Zilio, Bernard Berthomieu
A classical method for model-checking timed properties-such as those expressed using timed extensions of temporal logic-is to rely on the use of observers. In this context, a major…