Pages that link to "Item:Q5096743"

The following pages link to Polynomial algorithms for the synthesis of bounded nets (Q5096743):

Displaying 21 items.

• Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759) (← links)
• The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
• Discovering workflow nets using integer linear programming (Q1639990) (← links)
• Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
• Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems (Q2115918) (← links)
• Topics in region theory and synthesis problems (Q2117149) (← links)
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174) (← links)
• Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
• Synthesis and reengineering of persistent systems (Q2257983) (← links)
• Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets (Q3510859) (← links)
• Process Discovery Using Integer Linear Programming (Q3510879) (← links)
• Target-oriented Petri Net Synthesis (Q4988954) (← links)
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057) (← links)
• The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
• Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)
• Synthesis of Nets with Step Firing Policies (Q5900140) (← links)
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets (Q6070613) (← links)