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 2021Show all

3 papers · 1 filter

cs.FL2021

Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues

Raymond Devillers, Ronny Tredup

Petri net synthesis consists in deciding for a given transition system $A$ whether there exists a Petri net $N$ whose reachability graph is isomorphic to $A$ . Several works examine…

cs.FL2021

Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues

Raymond Devillers, Ronny Tredup

In Petri net synthesis we ask whether a given transition system $A$ can be implemented by a Petri net $N$ . Depending on the level of accuracy, there are three ways how $N$ can impl…

cs.CC2021

The Complexity of Synthesis of $b$ -Bounded Petri Nets

Ronny Tredup

For a fixed type of Petri nets $τ$ , \textsc{ $τ$ -Synthesis} is the task of finding for a given transition system $A$ a Petri net $N$ of type $τ$ ( $τ$ -net, for short) whose reachabil…

Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues

Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues

The Complexity of Synthesis of b-Bounded Petri Nets

The Complexity of Synthesis of $b$ -Bounded Petri Nets