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 cs.LOShow all

3 papers · 1 filter

cs.LO2020★ 1 cited

The Complexity of Boolean State Separation (Technical Report)

Ronny Tredup, Evgeny Erofeev

For a Boolean type of nets $τ$ , a transition system $A$ is synthesizeable into a $τ$ -net $N$ if and only if distinct states of $A$ correspond to distinct markings of $N$ , and $N$ p…

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…

cs.LO2017★ 2 cited

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs

Christian Rosenke, Ronny Tredup

Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis problem has important applications in the design of digital hardware and commercial proce…

The Complexity of Boolean State Separation (Technical Report)

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

The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs

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