6 citations · 14 across the 6 of their papers we have counts for
8 papers
The Complexity of Boolean State Separation (Technical Report)
Ronny Tredup, Evgeny Erofeev
For a Boolean type of nets , a transition system is synthesizeable into a -net if and only if distinct states of correspond to distinct markings of , and p…
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
Ronny Tredup, Evgeny Erofeev
Modeling of real-world systems with Petri nets allows to benefit from their generic concepts of parallelism, synchronisation and conflict, and obtain a concise yet expressive syste…
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report)
Ronny Tredup, Evgeny Erofeev
The problem of -synthesis consists in deciding whether a given directed labeled graph is isomorphic to the reachability graph of a Boolean Petri net of type . In case…
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…
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…
Hardness Results for the Synthesis of -bounded Petri Nets (Technical Report)
Ronny Tredup
Synthesis for a type of Petri nets is the following search problem: For a transition system , find a Petri net of type whose state graph is isomorphic to , if the…