35 citations · 102 across the 18 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LO2022
Separators in Continuous Petri Nets
Michael Blondin, Javier Esparza
Leroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking cannot reach a marking ,…
cs.LO2022
Verifying generalised and structural soundness of workflow nets via relaxations
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Workflow nets are a well-established mathematical formalism for the analysis of business processes arising from either modeling tools or process mining. The central decision proble…
cs.LO2022
The complexity of soundness in workflow nets
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
Workflow nets are a popular variant of Petri nets that allow for algorithmic formal analysis of business processes. The central decision problems concerning workflow nets deal with…