The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs. - Christian Rosenke; Ronny Tredup (CoRR, 2017)

Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs. - Ronny Tredup; Christian Rosenke; Karsten Wolf (Petri Nets, 2018)

Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. - Ronny Tredup; Christian Rosenke (CONCUR, 2018)

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis. - Ronny Tredup; Christian Rosenke (CoRR, 2018)

Hardness Results for the Synthesis of b-bounded Petri Nets. - Ronny Tredup (Petri Nets, 2019)

Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets. - Ronny Tredup (Petri Nets, 2019)

On the Hardness of Synthesizing Boolean Nets. - Ronny Tredup; Christian Rosenke (ATAED@Petri Nets/ACSD, 2019)

Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. - Ronny Tredup (RP, 2019)

The Complexity of Synthesis for 43 Boolean Petri Net Types. - Ronny Tredup; Christian Rosenke (TAMC, 2019)

Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report). - Ronny Tredup (CoRR, 2019)

Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete. - Ronny Tredup (ICE, 2019)

The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report). - Ronny Tredup (CoRR, 2019)

On the Complexity of Synthesis of nop-Free Boolean Petri Nets. - Ronny Tredup; Evgeny Erofeev (ATAED@Petri Nets, 2020)

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm. - Evgeny Erofeev; Ronny Tredup (ICTAC, 2020)

The Complexity of Boolean State Separation. - Ronny Tredup; Evgeny Erofeev (ICTAC, 2020)

Finding an Optimal Label-Splitting to Make a Transition System Petri Net Implementable: a Complete Complexity Characterization. - Ronny Tredup (ICTCS, 2020)

The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets. - Ronny Tredup (RP, 2020)

Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems. - Ronny Tredup (SOFSEM, 2020)

On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. - Ronny Tredup; Evgeny Erofeev (TAMC, 2020)

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report). - Ronny Tredup; Evgeny Erofeev (CoRR, 2020)

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency. - Ronny Tredup; Evgeny Erofeev (ICE, 2020)

The Complexity of Boolean State Separation (Technical Report). - Ronny Tredup; Evgeny Erofeev (CoRR, 2020)

The complexity of synthesizing elementary net systems relative to natural parameters. - Christian Rosenke; Ronny Tredup (J. Comput. Syst. Sci., 2020)

Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable. - Ronny Tredup (Petri Nets, 2021)

Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized. - Ronny Tredup (Petri Nets, 2021)

The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete. - Ronny Tredup; Sophie Wallner (PNSE@Petri Nets, 2021)

The Complexity of Synthesis of b-Bounded Petri Nets. - Ronny Tredup (CoRR, 2021)

The Complexity of Synthesis of b-Bounded Petri Nets. - Ronny Tredup (Fundam. Informaticae, 2021)

On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. - Ronny Tredup; Evgeny Erofeev (Theor. Comput. Sci., 2021)

The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs. - Ronny Tredup (Trans. Petri Nets Other Model. Concurr., 2021)

Zur Komplexität der Synthese von Petri-Netzen - Ronny Tredup (2021)

Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. - Raymond Devillers; Ronny Tredup (Petri Nets, 2022)

Complexity of Distributed Petri Net Synthesis. - Raymond Devillers; Ronny Tredup (TASE, 2022)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)

Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. - Raymond Devillers; Ronny Tredup (Fundam. Informaticae, 2022)