Pages that link to "Item:Q5212019"
From MaRDI portal
The following pages link to Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods (Q5212019):
Displaying 7 items.
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach (Q2032916) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)