The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs

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]

Abstract

Abstract is missing.