The complexity of synthesis for 43 Boolean Petri net types

DOI10.1007/978-3-030-14812-6_38OpenAlexW2936354745MaRDI QIDQ2327509

Christian Rosenke, Ronny Tredup

Publication date: 15 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-14812-6_38

Mathematics Subject Classification ID

Related Items (5)

Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ The complexity of synthesizing elementary net systems relative to natural parameters ⋮ The Complexity of Synthesis of b-Bounded Petri Nets

This page was built for publication: The complexity of synthesis for 43 Boolean Petri net types