Ronny Tredup

According to our database, Ronny Tredup authored at least 36 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets.

Raymond R. Devillers, Ronny Tredup

Fundam. Informaticae, 2022

Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues.

Raymond R. Devillers, Ronny Tredup

Fundam. Informaticae, 2022

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues.

Raymond R. Devillers, Ronny Tredup

Fundam. Informaticae, 2022

Complexity of Distributed Petri Net Synthesis.

Raymond R. Devillers, Ronny Tredup

Proceedings of the Theoretical Aspects of Software Engineering, 2022

Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues.

Raymond R. Devillers, Ronny Tredup

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2022

2021

Zur Komplexität der Synthese von Petri-Netzen

Ronny Tredup

PhD thesis, 2021

The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs.

Ronny Tredup

Trans. Petri Nets Other Model. Concurr., 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 Synthesis of <i>b</i>-Bounded Petri Nets.

Ronny Tredup

Fundam. Informaticae, 2021

The Complexity of Synthesis of b-Bounded Petri Nets.

Ronny Tredup

CoRR, 2021

The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete.

Ronny Tredup, Sophie Wallner

Proceedings of the International Workshop on Petri Nets and Software Engineering 2021 co-located with the 42nd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2021), 2021

Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized.

Ronny Tredup

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2021

Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable.

Ronny Tredup

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2021

2020

The complexity of synthesizing elementary net systems relative to natural parameters.

Christian Rosenke, Ronny Tredup

J. Comput. Syst. Sci., 2020

The Complexity of Boolean State Separation (Technical Report).

Ronny Tredup, Evgeny Erofeev

CoRR, 2020

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Proceedings 13th Interaction and Concurrency Experience, 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 <i>d</i>-Restricted Boolean Net Synthesis.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Theory and Applications of Models of Computation, 2020

Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems.

Ronny Tredup

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets.

Ronny Tredup

Proceedings of the Reachability Problems - 14th International Conference, 2020

Finding an Optimal Label-Splitting to Make a Transition System Petri Net Implementable: a Complete Complexity Characterization.

Ronny Tredup

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

The Complexity of Boolean State Separation.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm.

Evgeny Erofeev, Ronny Tredup

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

On the Complexity of Synthesis of nop-Free Boolean Petri Nets.

Ronny Tredup, Evgeny Erofeev

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2020 Satellite event of the 41st International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2020, 2020

2019

The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (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

Proceedings of the Proceedings 12th Interaction and Concurrency Experience, 2019

Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report).

Ronny Tredup

CoRR, 2019

The Complexity of Synthesis for 43 Boolean Petri Net Types.

Ronny Tredup, Christian Rosenke

Proceedings of the Theory and Applications of Models of Computation, 2019

Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results.

Ronny Tredup

Proceedings of the Reachability Problems - 13th International Conference, 2019

On the Hardness of Synthesizing Boolean Nets.

Ronny Tredup, Christian Rosenke

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2019 Satellite event of the conferences: 40th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2019 and 19th International Conference on Application of Concurrency to System Design ACSD 2019, 2019

Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets.

Ronny Tredup

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

Hardness Results for the Synthesis of b-bounded Petri Nets.

Ronny Tredup

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis.

Ronny Tredup, Christian Rosenke

CoRR, 2018

Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems.

Ronny Tredup, Christian Rosenke

Proceedings of the 29th International Conference on Concurrency Theory, 2018

Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs.

Ronny Tredup, Christian Rosenke, Karsten Wolf

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs.

Christian Rosenke, Ronny Tredup

CoRR, 2017