The Complexity of Synthesis of b-Bounded Petri Nets

DOI10.3233/FI-2021-2084OpenAlexW4206540547MaRDI QIDQ5025061

Ronny Tredup

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15256

zbMATH Keywords

synthesisSSPsolvabilityPetri nets\(b\)-boundedESSP

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues

Uses Software

• APT

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Contextual nets
• Trace nets and process automata
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• Elementary net synthesis remains NP-complete even for extremely simple inputs
• The complexity of synthesis for 43 Boolean Petri net types
• Step semantics of Boolean nets
• Process algebras for Petri nets. The alphabetization of distributed systems
• Process Mining
• Finding optimum branchings
• Flip-flop nets
• Polynomial algorithms for the synthesis of bounded nets
• k-Bounded Petri Net Synthesis from Modal Transition Systems.
• Hard tiling problems with simple tiles

This page was built for publication: The Complexity of Synthesis of b-Bounded Petri Nets