Pages that link to "Item:Q5883572"
From MaRDI portal
The following pages link to Petri Net Reductions for Counting Markings (Q5883572):
Displaying 7 items.
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets (Q2117166) (← links)
- Computing Petri net languages by reductions (Q5055897) (← links)
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns (Q6189320) (← links)
- Automated polyhedral abstraction proving (Q6535199) (← links)
- On the complexity of proving polyhedral reductions (Q6622144) (← links)