Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems

DOI10.1007/978-3-030-38919-2_19zbMath1440.68179OpenAlexW2999890010MaRDI QIDQ3297771

Ronny Tredup

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

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

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)

Related Items (1)

Synthesis of Petri nets with restricted place-environments: classical and parameterized

Uses Software

• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net synthesis
• The synthesis problem for elementary net systems is NP-complete
• The synthesis of Petri nets from path-automatic specifications
• Analysis and synthesis of weighted marked graph Petri nets
• Elementary net synthesis remains NP-complete even for extremely simple inputs
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• State space axioms for T-systems
• 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
• Parameterized Algorithms
• Lectures on Concurrency and Petri Nets

This page was built for publication: Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems