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

DOI10.1007/978-3-030-76983-3_15zbMATH Open1489.68169OpenAlexW3172065072MaRDI QIDQ2117176FDOQ2117176

Publication date: 21 March 2022

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

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

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)

Cites Work

Reducibility among combinatorial problems
Free Choice Petri Nets
Marked directed graphs
Process mining. Discovery, conformance and enhancement of business processes.
A survey of Petri net methods for controlled discrete event systems
Partial (set) 2-structures. I: Basic notions and the representation problems
Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18--20, 2020. Proceedings
A decomposition theorem for finite persistent transition systems
Synthesis of live and bounded persistent systems
Petri net synthesis
Title not available (Why is that?)
The synthesis problem for elementary net systems is NP-complete
Polynomial algorithms for the synthesis of bounded nets
Sufficient conditions for the marked graph realisability of labelled transition systems
Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
Bounded choice-free Petri net synthesis: algorithmic issues
Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
Distributing finite automata through Petri net synthesis
Deriving Petri nets from finite transition systems
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
On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
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
Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems

Cited In (7)

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

Uses Software

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)