6 citations · 12 across the 5 of their papers we have counts for
5 papers
Property Directed Reachability for Generalized Petri Nets
Nicolas Amat, Silvano Dal Zilio, Thomas Hujsa
We propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method.…
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.…
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach
Raymond Devillers, Evgeny Erofeev, Thomas Hujsa
Recent studies investigated the problems of analysing Petri nets and synthesising them from labelled transition systems (LTS) with two labels (transitions) only. In this paper, we…
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond
Raymond Devillers, Evgeny Erofeev, Thomas Hujsa
In previous studies, several methods have been developed to synthesise Petri nets from labelled transition systems (LTS), often with structural constraints on the net and on the LT…