The Complexity of Synthesizing $$\textsf {nop}$$-Equipped Boolean Petri Nets from g-Bounded Inputs
Crossref DOI link: https://doi.org/10.1007/978-3-662-63079-2_5
Published Online: 2021-02-25
Published Print: 2021
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Tredup, Ronny
Text and Data Mining valid from 2021-01-01
Version of Record valid from 2021-01-01
Chapter History
First Online: 25 February 2021