Ronny Tredup

MaRDI QIDQ2032840zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Hardness Results for the Synthesis of b-bounded Petri Nets Application and Theory of Petri Nets and Concurrency	2024-01-29	Paper
Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets Application and Theory of Petri Nets and Concurrency	2024-01-29	Paper
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets Fundamenta Informaticae	2023-11-23	Paper
On the parameterized complexity of \(d\)-restricted Boolean net synthesis	2022-12-22	Paper
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues Fundamenta Informaticae	2022-10-31	Paper
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues Fundamenta Informaticae	2022-10-31	Paper
Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues	2022-08-19	Paper
Synthesis of Petri nets with restricted place-environments: classical and parameterized	2022-03-21	Paper
Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable	2022-03-21	Paper
The Complexity of Synthesis of b-Bounded Petri Nets Fundamenta Informaticae	2022-02-01	Paper
On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency	2022-01-10	Paper
On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (available as arXiv preprint)	2022-01-10	Paper
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments Theoretical Computer Science	2021-10-21	Paper
Narrowing down the hardness barrier of synthesizing elementary net systems	2021-08-04	Paper
The complexity of Boolean state separation (available as arXiv preprint)	2021-07-08	Paper
Occupancy number restricted Boolean Petri net synthesis: a fixed-parameter algorithm	2021-07-08	Paper
The complexity of the label-splitting-problem for flip-flop-nets	2021-07-06	Paper
The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (available as arXiv preprint)	2021-06-14	Paper
Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems SOFSEM 2020: Theory and Practice of Computer Science	2020-07-20	Paper
The complexity of synthesizing elementary net systems relative to natural parameters Journal of Computer and System Sciences	2020-03-13	Paper
Elementary net synthesis remains NP-complete even for extremely simple inputs	2019-12-18	Paper
Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results	2019-10-22	Paper
The complexity of synthesis for 43 Boolean Petri net types	2019-10-15	Paper

Research outcomes over time

This page was built for person: Ronny Tredup