research
∙
03/17/2022
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
Synthesis consists in deciding whether a given labeled transition system...
share
research
∙
06/29/2021
The Complexity of Synthesis of b-Bounded Petri Nets
For a fixed type of Petri nets τ, τ-Synthesis is the task of finding for...
research
∙
10/02/2020
The Complexity of Boolean State Separation (Technical Report)
For a Boolean type of nets τ, a transition system A is synthesizeable in...
research
∙
09/17/2020
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
Modeling of real-world systems with Petri nets allows to benefit from th...
research
∙
07/24/2020
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)
The problem of τ-synthesis consists in deciding whether a given directed...
research
∙
11/01/2019
The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)
Boolean Petri nets equipped with nop allow places and transitions to be ...
research
∙
09/12/2019
Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete
Boolean Petri nets are differentiated by types of nets τ based on which ...
research
∙
03/17/2019
Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report)
Synthesis for a type τ of Petri nets is the following search problem: Fo...
research
∙
06/10/2018
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis
Boolean nets are Petri nets that permit at most one token per place. Res...
research
∙
11/01/2017