Formalisms for concurrency and distribution. - Evgeny Erofeev (Joint Workshop of the German Research Training Groups in Computer Science, 2014)

On Binary Words Being Petri Net Solvable. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (ATAED@Petri Nets/ACSD, 2015)

Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures. - Irina B. Virbitskaite; Elena N. Bozhenkova; Evgeny Erofeev (CS&P, 2015)

Characterising Petri Net Solvable Binary Words. - Eike Best; Evgeny Erofeev; Uli Schlachter; Harro Wimmel (Petri Nets, 2016)

Conditions for Petri Net Solvable Binary Words. - Kamila Barylska; Eike Best; Evgeny Erofeev; Lukasz Mikulski; Marcin Piatkowski (Trans. Petri Nets Other Model. Concurr., 2016)

Reachability Graphs of Two-Transition Petri Nets. - Evgeny Erofeev; Harro Wimmel (ATAED@Petri Nets/ACSD, 2017)

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (ATAED@Petri Nets/ACSD, 2018)

Reversing Transitions in Bounded Petri Nets. - Kamila Barylska; Evgeny Erofeev; Maciej Koutny; Lukasz Mikulski; Marcin Piatkowski (Fundam. Informaticae, 2018)

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (ATAED@Petri Nets/ACSD, 2019)

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (Trans. Petri Nets Other Model. Concurr., 2019)

A New Property of Choice-Free Petri Net Systems. - Eike Best; Raymond Devillers; Evgeny Erofeev (Petri Nets, 2020)

On the Complexity of Synthesis of nop-Free Boolean Petri Nets. - Ronny Tredup; Evgeny Erofeev (ATAED@Petri Nets, 2020)

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm. - Evgeny Erofeev; Ronny Tredup (ICTAC, 2020)

The Complexity of Boolean State Separation. - Ronny Tredup; Evgeny Erofeev (ICTAC, 2020)

On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. - Ronny Tredup; Evgeny Erofeev (TAMC, 2020)

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report). - Ronny Tredup; Evgeny Erofeev (CoRR, 2020)

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency. - Ronny Tredup; Evgeny Erofeev (ICE, 2020)

The Complexity of Boolean State Separation (Technical Report). - Ronny Tredup; Evgeny Erofeev (CoRR, 2020)

Generating all minimal petri net unsolvable binary words. - Evgeny Erofeev; Kamila Barylska; Lukasz Mikulski; Marcin Piatkowski (Discret. Appl. Math., 2020)

Target-oriented Petri Net Synthesis. - Eike Best; Raymond Devillers; Evgeny Erofeev; Harro Wimmel (Fundam. Informaticae, 2020)

28 GHz Single-Chip Transmit RF Front-End MMIC for Multichannel 5G Wireless Communications. - Evgeny Erofeev; Vadim Arykov; Michael Stepanenko; Aleksei Voevodin; Aleksei Kogai; Vladimir Kurikalov (Symmetry, 2020)

On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. - Ronny Tredup; Evgeny Erofeev (Theor. Comput. Sci., 2021)

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond. - Raymond Devillers; Evgeny Erofeev; Thomas Hujsa (Trans. Petri Nets Other Model. Concurr., 2021)