6 citations · 12 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LO2020
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…
cs.DS2020★ 1 cited
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.…