Ronny Tredup

activity

20172022

most citedThe Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)

6 citations · 21 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.CC2019★ 6 cited

The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)

Ronny Tredup

Boolean Petri nets equipped with nop allow places and transitions to be independent by being related by nop. We characterize for any fixed natural number g the computational comple…

cs.CC2019★ 1 cited

Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete

Ronny Tredup

Boolean Petri nets are differentiated by types of nets $τ$ based on which of the interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis probl…

cs.LO2019★ 1 cited

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

Ronny Tredup

Synthesis for a type $τ$ of Petri nets is the following search problem: For a transition system $A$ , find a Petri net $N$ of type $τ$ whose state graph is isomorphic to $A$ , if the…

The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)

Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete

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

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