Evgeny Erofeev

MaRDI QIDQ2032838zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the parameterized complexity of \(d\)-restricted Boolean net synthesis	2022-12-22	Paper
A new property of choice-free Petri net systems Application and Theory of Petri Nets and Concurrency	2022-09-01	Paper
On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency	2022-01-10	Paper
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments Theoretical Computer Science	2021-10-21	Paper
The complexity of Boolean state separation	2021-07-08	Paper
Occupancy number restricted Boolean Petri net synthesis: a fixed-parameter algorithm	2021-07-08	Paper
Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach	2021-06-14	Paper
Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond	2021-06-14	Paper
Target-oriented Petri net synthesis Fundamenta Informaticae	2021-05-20	Paper
Generating all minimal Petri net unsolvable binary words Discrete Applied Mathematics	2020-02-14	Paper
Reversing transitions in bounded Petri nets Fundamenta Informaticae	2018-05-03	Paper
Conditions for Petri net solvable binary words Transactions on Petri Nets and Other Models of Concurrency XI	2017-06-20	Paper
Characterising Petri net solvable binary words Application and Theory of Petri Nets and Concurrency	2016-10-04	Paper

Research outcomes over time

This page was built for person: Evgeny Erofeev