6 citations · 21 across the 9 of their papers we have counts for
Showing 2020Show 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 is synthesizeable into a -net if and only if distinct states of correspond to distinct markings of , and p…
cs.CC2020★ 3 cited
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…
cs.CC2020★ 1 cited
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…