Pages that link to "Item:Q3510859"
From MaRDI portal
The following pages link to A Symbolic Algorithm for the Synthesis of Bounded Petri Nets (Q3510859):
Displayed 11 items.
- Projection approaches to process mining using region-based techniques (Q408692) (← links)
- The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems (Q2115918) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Fault model identification and synthesis in Petri nets (Q2348378) (← links)
- Petri Net Synthesis for Restricted Classes of Nets (Q2822652) (← links)
- Process discovery and Petri nets (Q3655758) (← links)
- Discovering Object-centric Petri Nets (Q4988950) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)