Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets

DOI10.1007/978-3-030-21571-2_10OpenAlexW2949895189MaRDI QIDQ6144212

Ronny Tredup

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21571-2_10

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Petri net synthesis
• Some complexity results on transition systems and elementary net systems
• A survey of Petri net methods for controlled discrete event systems
• The synthesis problem for elementary net systems is NP-complete
• Distributing finite automata through Petri net synthesis
• The complexity of solving equations over finite groups
• Elementary net synthesis remains NP-complete even for extremely simple inputs
• The complexity of synthesis for 43 Boolean Petri net types
• Process Mining
• Petri Net Distributability
• Finding optimum branchings
• Flip-flop nets
• Polynomial algorithms for the synthesis of bounded nets
• k-Bounded Petri Net Synthesis from Modal Transition Systems.
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

This page was built for publication: Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets