research
∙
06/17/2023
Sleptsov Nets are Turing-complete
The present paper proves that a Sleptsov net (SN) is Turing-complete, th...
share
research
∙
04/20/2021
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets
We define a method for taking advantage of net reductions in combination...
research
∙
06/10/2020
Checking marking reachability with the state equation in Petri net subclasses
Although decidable, the marking reachability problem for Petri nets is w...
research
∙
05/11/2020
On the Petri Nets with a Single Shared Place and Beyond
Petri nets proved useful to describe various real-world systems, but man...
research
∙
07/09/2018
