Evgeny Erofeev
Evgeny Erofeev
Verified email at informatik.uni-oldenburg.de
Title
Cited by
Cited by
Year
On Binary Words Being Petri Net Solvable.
K Barylska, E Best, E Erofeev, L Mikulski, M Piatkowski
ATAED@ Petri Nets/ACSD, 1-15, 2015
172015
Characterising Petri net solvable binary words
E Best, E Erofeev, U Schlachter, H Wimmel
International Conference on Applications and Theory of Petri Nets and†…, 2016
162016
Reversing transitions in bounded Petri nets
K Barylska, E Erofeev, M Koutny, Ł Mikulski, M Piątkowski
Fundamenta Informaticae 157 (4), 341-357, 2018
142018
Generating All Minimal Petri Net Unsolvable Binary Words.
E Erofeev, K Barylska, L Mikulski, M Piatkowski
Stringology, 33-46, 2016
112016
Conditions for Petri net solvable binary words
K Barylska, E Best, E Erofeev, Ł Mikulski, M Piątkowski
Transactions on Petri Nets and Other Models of Concurrency XI, 137-159, 2016
92016
Reachability Graphs of Two-Transition Petri Nets.
E Erofeev, H Wimmel
ATAED@ Petri Nets/ACSD, 39-54, 2017
82017
Synthesis of weighted marked graphs from circular labelled transition systems
R Devillers, E Erofeev, T Hujsa
International Workshop on Algorithms & Theories for the Analysis of Event†…, 2019
72019
Synthesis of weighted marked graphs from constrained labelled transition systems
R Devillers, E Erofeev, T Hujsa
ATAED@ Petri Nets/ACSD 2018, 2018
62018
Characterisation of a class of Petri net solvable transition systems
E Erofeev
Universitšt Oldenburg, 2018
42018
On the Parameterized Complexity of d-Restricted Boolean Net Synthesis
R Tredup, E Erofeev
International Conference on Theory and Applications of Models of Computation†…, 2020
32020
Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
R Devillers, E Erofeev, T Hujsa
Transactions on Petri Nets and Other Models of Concurrency XIV, 172-191, 2019
32019
On the complexity of synthesis of nop-free Boolean Petri nets
R Tredup, E Erofeev
Proceedings of the International Workshop on Algorithms & Theories for the†…, 2020
22020
Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures.
IB Virbitskaite, EN Bozhenkova, E Erofeev
CS&P, 222-233, 2015
22015
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond
R Devillers, E Erofeev, T Hujsa
arXiv preprint arXiv:1910.14387, 2019
12019
Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond
R Devillers, E Erofeev, T Hujsa
Transactions on Petri Nets and Other Models of Concurrency XV, 75-100, 2021
2021
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm
E Erofeev, R Tredup
International Colloquium on Theoretical Aspects of Computing, 143-160, 2020
2020
The Complexity of Boolean State Separation
R Tredup, E Erofeev
International Colloquium on Theoretical Aspects of Computing, 123-142, 2020
2020
Target-oriented Petri Net Synthesis
R Devillers, E Best, E Erofeev, H Wimmel
A Mosaic of Computational Topics: from Classical to Novel: Dedicated to†…, 2020
2020
The Complexity of Boolean State Separation (Technical Report)
R Tredup, E Erofeev
arXiv preprint arXiv:2010.00825, 2020
2020
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency
R Tredup, E Erofeev
arXiv preprint arXiv:2009.08871, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20