Follow
Evgeny Erofeev
Evgeny Erofeev
Verified email at informatik.uni-oldenburg.de
Title
Cited by
Cited by
Year
Reversing transitions in bounded Petri nets
K Barylska, E Erofeev, M Koutny, Ł Mikulski, M Piątkowski
Fundamenta Informaticae 157 (4), 341-357, 2018
232018
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
182016
Generating All Minimal Petri Net Unsolvable Binary Words.
E Erofeev, K Barylska, L Mikulski, M Piatkowski
Stringology, 33-46, 2016
17*2016
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
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
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
72018
Reachability Graphs of Two-Transition Petri Nets.
E Erofeev, H Wimmel
ATAED@ Petri Nets/ACSD, 39-54, 2017
72017
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
52020
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
52019
Characterisation of a class of Petri net solvable transition systems
E Erofeev
Universitšt Oldenburg, 2018
42018
On the parameterized complexity of synthesizing boolean petri nets with restricted dependency
R Tredup, E Erofeev
arXiv preprint arXiv:2009.08871, 2020
32020
A new property of choice-free Petri net systems
E Best, R Devillers, E Erofeev
International Conference on Applications and Theory of Petri Nets and†…, 2020
32020
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
22021
Target-oriented Petri net synthesis
E Best, R Devillers, E Erofeev, H Wimmel
Fundamenta Informaticae 175 (1-4), 97-122, 2020
22020
On the Complexity of Synthesis of nop-Free Boolean Petri Nets.
R Tredup, E Erofeev
ATAED@ Petri Nets, 66-84, 2020
22020
Space-Time Viewpoints for Concurrent Processes Represented by Relational Structures.
IB Virbitskaite, EN Bozhenkova, E Erofeev
CS&P, 222-233, 2015
22015
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
12020
The Complexity of Boolean State Separation
R Tredup, E Erofeev
International Colloquium on Theoretical Aspects of Computing, 123-142, 2020
12020
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
R Tredup, E Erofeev
Theoretical Computer Science 890, 36-69, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20