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

DOI10.1007/978-3-030-76983-3_15MaRDI QIDQ2117176zbMATH OpenOpenAlexFDO

Authors 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

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• Petri Net Synthesis for Restricted Classes of Nets
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
• The Complexity of Synthesis of b-Bounded Petri Nets

Cites work

• scientific article; zbMATH DE number 4031000 (Why is no real title available?)
• A decomposition theorem for finite persistent transition systems
• A survey of Petri net methods for controlled discrete event systems
• Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
• Bounded choice-free Petri net synthesis: algorithmic issues
• Deriving Petri nets from finite transition systems
• Distributing finite automata through Petri net synthesis
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Free Choice Petri Nets
• Hardness Results for the Synthesis of b-bounded Petri Nets
• Marked directed graphs
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• On the reversibility of well-behaved weighted choice-free systems
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Petri net synthesis
• Polynomial algorithms for the synthesis of bounded nets
• Process mining. Discovery, conformance and enhancement of business processes.
• Reducibility among combinatorial problems
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Synthesis of live and bounded persistent systems
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• The synthesis problem for elementary net systems is NP-complete
• Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18--20, 2020. Proceedings

Cited in

(7)

• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Petri Net Synthesis for Restricted Classes of Nets
• Over-approximative Petri net synthesis for restricted subclasses of nets
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results

Describes a project that uses

Uses Software

• APT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117176)