Evgeny Erofeev

According to our database, Evgeny Erofeev authored at least 23 papers between 2014 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond.

Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa

Trans. Petri Nets Other Model. Concurr., 2021

On the parameterized complexity of the synthesis of Boolean nets with restricted place environments.

Ronny Tredup, Evgeny Erofeev

Theor. Comput. Sci., 2021

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

Target-oriented Petri Net Synthesis.

Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel

Fundam. Informaticae, 2020

Generating all minimal petri net unsolvable binary words.

Evgeny Erofeev, Kamila Barylska, Lukasz Mikulski, Marcin Piatkowski

Discret. Appl. Math., 2020

The Complexity of Boolean State Separation (Technical Report).

Ronny Tredup, Evgeny Erofeev

CoRR, 2020

On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Proceedings 13th Interaction and Concurrency Experience, 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 <i>d</i>-Restricted Boolean Net Synthesis.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Theory and Applications of Models of Computation, 2020

The Complexity of Boolean State Separation.

Ronny Tredup, Evgeny Erofeev

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm.

Evgeny Erofeev, Ronny Tredup

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

On the Complexity of Synthesis of nop-Free Boolean Petri Nets.

Ronny Tredup, Evgeny Erofeev

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2020 Satellite event of the 41st International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2020, 2020

A New Property of Choice-Free Petri Net Systems.

Eike Best, Raymond R. Devillers, Evgeny Erofeev

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach.

Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa

Trans. Petri Nets Other Model. Concurr., 2019

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems.

Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2019 Satellite event of the conferences: 40th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2019 and 19th International Conference on Application of Concurrency to System Design ACSD 2019, 2019

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 Constrained Labelled Transition Systems.

Raymond R. Devillers, Evgeny Erofeev, Thomas Hujsa

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD 2018, 2018

2017

Reachability Graphs of Two-Transition Petri Nets.

Evgeny Erofeev, Harro Wimmel

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2017 Satellite event of the conferences: 38th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2017 and 17th International Conference on Application of Concurrency to System Design ACSD 2017, 2017

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

Characterising Petri Net Solvable Binary Words.

Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015

Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures.

Irina B. Virbitskaite, Elena N. Bozhenkova, Evgeny Erofeev

Proceedings of the 24th International Workshop on Concurrency, 2015

On Binary Words Being Petri Net Solvable.

Kamila Barylska, Eike Best, Evgeny Erofeev, Lukasz Mikulski, Marcin Piatkowski

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, 2015

2014

Formalisms for concurrency and distribution.

Evgeny Erofeev

Proceedings of the 8th Joint Workshop of the German Research Training Groups in Computer Science, 2014