6 citations · 12 across the 5 of their papers we have counts for
5 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…
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach
Raymond Devillers, Evgeny Erofeev, Thomas Hujsa
Recent studies investigated the problems of analysing Petri nets and synthesising them from labelled transition systems (LTS) with two labels (transitions) only. In this paper, we…
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond
Raymond Devillers, Evgeny Erofeev, Thomas Hujsa
In previous studies, several methods have been developed to synthesise Petri nets from labelled transition systems (LTS), often with structural constraints on the net and on the LT…