Ronny Tredup

Publication Activity (10 Years)

Years Active: 2017-2022
Publications (10 Years): 38

Top Topics

Parameterized Complexity

Top Venues

Fundam. Informaticae

Publications

Raymond R. Devillers, Ronny Tredup
Complexity of Distributed Petri Net Synthesis. TASE (2022)
Raymond R. Devillers, Ronny Tredup
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. Petri Nets (2022)
Raymond R. Devillers, Ronny Tredup
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. CoRR (2022)
Raymond R. Devillers, Ronny Tredup
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. Fundam. Informaticae 187 (2-4) (2022)
Raymond R. Devillers, Ronny Tredup
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. Fundam. Informaticae 189 (3-4) (2022)
Raymond R. Devillers, Ronny Tredup
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. Fundam. Informaticae 187 (2-4) (2022)
Ronny Tredup, Sophie Wallner
The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete. PNSE@Petri Nets (2021)
Ronny Tredup, Evgeny Erofeev
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. Theor. Comput. Sci. 890 (2021)
Ronny Tredup
The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs. Trans. Petri Nets Other Model. Concurr. 15 (2021)
Ronny Tredup
The Complexity of Synthesis of b-Bounded Petri Nets. CoRR (2021)
Ronny Tredup
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable. Petri Nets (2021)
Raymond R. Devillers, Ronny Tredup
Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues. CoRR (2021)
Ronny Tredup
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized. Petri Nets (2021)
Raymond R. Devillers, Ronny Tredup
Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues. CoRR (2021)
Ronny Tredup
-Bounded Petri Nets. Fundam. Informaticae 183 (1-2) (2021)
Ronny Tredup, Evgeny Erofeev
The Complexity of Boolean State Separation. ICTAC (2020)
Evgeny Erofeev, Ronny Tredup
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm. ICTAC (2020)
Ronny Tredup, Evgeny Erofeev
The Complexity of Boolean State Separation (Technical Report). CoRR (2020)
Ronny Tredup
Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems. SOFSEM (2020)
Christian Rosenke, Ronny Tredup
The complexity of synthesizing elementary net systems relative to natural parameters. J. Comput. Syst. Sci. 110 (2020)
Ronny Tredup
Finding an Optimal Label-Splitting to Make a Transition System Petri Net Implementable: a Complete Complexity Characterization. ICTCS (2020)
Ronny Tredup, Evgeny Erofeev
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency. ICE (2020)
Ronny Tredup
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets. RP (2020)
Ronny Tredup, Evgeny Erofeev
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report). CoRR (2020)
Ronny Tredup, Evgeny Erofeev
-Restricted Boolean Net Synthesis. TAMC (2020)
Ronny Tredup, Evgeny Erofeev
On the Complexity of Synthesis of nop-Free Boolean Petri Nets. ATAED@Petri Nets (2020)
Ronny Tredup
Hardness Results for the Synthesis of b-bounded Petri Nets. Petri Nets (2019)
Ronny Tredup
Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report). CoRR (2019)
Ronny Tredup
The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report). CoRR (2019)
Ronny Tredup
Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete. ICE (2019)
Ronny Tredup
Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets. Petri Nets (2019)
Ronny Tredup, Christian Rosenke
The Complexity of Synthesis for 43 Boolean Petri Net Types. TAMC (2019)
Ronny Tredup, Christian Rosenke
On the Hardness of Synthesizing Boolean Nets. ATAED@Petri Nets/ACSD (2019)
Ronny Tredup
Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. RP (2019)
Ronny Tredup, Christian Rosenke
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis. CoRR (2018)
Ronny Tredup, Christian Rosenke
Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. CONCUR (2018)
Ronny Tredup, Christian Rosenke, Karsten Wolf
Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs. Petri Nets (2018)
Christian Rosenke, Ronny Tredup
The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs. CoRR (2017)