Polynomial algorithms for the synthesis of bounded nets
From MaRDI portal
Publication:5096743
Recommendations
- Publication:4203989
- Polynomial algorithms to finite Veber problem for a tree network
- Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems
- Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks
- Polynomial dual network simplex algorithms
- Boolean algebra of nets, their synthesis and analysis
- A polynomial algorithm for computing elementary siphons in a class of Petri nets
- Polygraphic programs and polynomial-time functions
- Polynomial algorithms for solving the quadratic assignment problem on networks
- scientific article; zbMATH DE number 5925034
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 512821 (Why is no real title available?)
- scientific article; zbMATH DE number 554482 (Why is no real title available?)
- scientific article; zbMATH DE number 1995178 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A trace semantics for Petri Nets
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Some complexity results on transition systems and elementary net systems
Cited in
(31)- Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
- Synthesis of Nets with Step Firing Policies
- The Complexity of Synthesis of b-Bounded Petri Nets
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Coupling asynchrony and interrupts: Place Chart Nets
- Process Discovery Using Integer Linear Programming
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- Hardness Results for the Synthesis of b-bounded Petri Nets
- Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
- The synthesis problem for elementary net systems is NP-complete
- Topics in region theory and synthesis problems
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Elementary net synthesis remains NP-complete even for extremely simple inputs
- Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
- Lectures on Concurrency and Petri Nets
- Stratified petri nets
- Dualities between nets and automata induced by schizophrenic objects
- Flip-flop nets
- Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- Bounded choice-free Petri net synthesis: algorithmic issues
- Target-oriented Petri net synthesis
- Synthesis and reengineering of persistent systems
- Discovering workflow nets using integer linear programming
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
This page was built for publication: Polynomial algorithms for the synthesis of bounded nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096743)
