Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
From MaRDI portal
Publication:2330603
DOI10.1007/978-3-030-30806-3_16zbMath1441.68147OpenAlexW2971541266MaRDI QIDQ2330603
Publication date: 22 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-30806-3_16
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Unnamed Item ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Synthesis of (choice-free) reset nets ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
This page was built for publication: Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
