Pages that link to "Item:Q2117166"
From MaRDI portal
The following pages link to On the combination of polyhedral abstraction and SMT-based model checking for Petri nets (Q2117166):
Displaying 4 items.
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Automated polyhedral abstraction proving (Q6535199) (← links)
- Property directed reachability for generalized Petri nets (Q6535575) (← links)
- On the complexity of proving polyhedral reductions (Q6622144) (← links)
