Ronny Tredup. The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs. T. Petri Nets and Other Models of Concurrency, 15:101-125, 2021. [doi]
@article{Tredup21,
title = {The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs},
author = {Ronny Tredup},
year = {2021},
doi = {10.1007/978-3-662-63079-2_5},
url = {https://doi.org/10.1007/978-3-662-63079-2_5},
researchr = {https://researchr.org/publication/Tredup21},
cites = {0},
citedby = {0},
journal = {T. Petri Nets and Other Models of Concurrency},
volume = {15},
pages = {101-125},
}