Pages that link to "Item:Q1878911"
From MaRDI portal
The following pages link to SAT-solving the coverability problem for Petri nets (Q1878911):
Displaying 5 items.
- Preserving correctness during business process model configuration (Q973035) (← links)
- An improvement of McMillan's unfolding algorithm (Q1600655) (← links)
- Unfolding based alorithms for the reachability problem (Q2775861) (← links)
- Finding Lean Induced Cycles in Binary Hypercubes (Q3637155) (← links)
- A Programming Language for Spatial Distribution of Net Systems (Q5166761) (← links)