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

DOI10.1007/978-3-030-76983-3_15zbMath1489.68169OpenAlexW3172065072MaRDI QIDQ2117176

Ronny Tredup

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_15

Mathematics Subject Classification ID

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 (1)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues

Uses Software

• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Petri net synthesis
• Partial (set) 2-structures. I: Basic notions and the representation problems
• A decomposition theorem for finite persistent transition systems
• A survey of Petri net methods for controlled discrete event systems
• The synthesis problem for elementary net systems is NP-complete
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Bounded choice-free Petri net synthesis: algorithmic issues
• Distributing finite automata through Petri net synthesis
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18--20, 2020. Proceedings
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• Marked directed graphs
• Synthesis of Live and Bounded Persistent Systems
• Process Mining
• Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems
• Deriving Petri nets from finite transition systems
• Free Choice Petri Nets
• Reducibility among Combinatorial Problems
• Polynomial algorithms for the synthesis of bounded nets
• On the Reversibility of Well-Behaved Weighted Choice-Free Systems
• Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods
• Hardness Results for the Synthesis of b-bounded Petri Nets

This page was built for publication: Synthesis of Petri nets with restricted place-environments: classical and parameterized