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

von Tredup, Ronny
Veröffentlicht in SOFSEM (46. : 2020 : Limassol) SOFSEM 2020 (2020)

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

von Tredup, Ronny
Veröffentlicht in PETRI NETS (42. : 2021 : Online) Application and Theory of Petri Nets and Concurrency (2021)

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

von Tredup, Ronny
Veröffentlicht in RP (14. : 2020 : Online) Reachability problems (2020)

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

von Tredup, Ronny
Veröffentlicht in PETRI NETS (42. : 2021 : Online) Application and Theory of Petri Nets and Concurrency (2021)

On the Parameterized Complexity of d-Restricted Boolean Net Synthesis

von Tredup, Ronny
Veröffentlicht in TAMC (16. : 2020 : Online) Theory and applications of models of computation (2020)

Complexity of Distributed Petri Net Synthesis

von Devillers, Raymond
Veröffentlicht in International Symposium on Theoretical Aspects of Software Engineering (16. : 2022 : Cluj-Napoca) Theoretical aspects of software engineering (2022)

The Complexity of Boolean State Separation

von Tredup, Ronny
Veröffentlicht in ICTAC (17. : 2020 : Online) Theoretical aspects of computing - ICTAC 2020 (2020)

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

von Erofeev, Evgeny
Veröffentlicht in ICTAC (17. : 2020 : Online) Theoretical aspects of computing - ICTAC 2020 (2020)

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

von Devillers, Raymond
Veröffentlicht in International Conference on Application and Theory of Petri Nets and Concurrency (43. : 2022 : Bergen, Norwegen) Application and theory of petri nets and concurrency (2022)