Ronny Tredup

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