Pages that link to "Item:Q2257983"
From MaRDI portal
The following pages link to Synthesis and reengineering of persistent systems (Q2257983):
Displayed 7 items.
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← 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)
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174) (← links)
- An extension of the taxonomy of persistent and nonviolent steps (Q2293146) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)