The following pages link to NUPN_INFO (Q40851):
Displaying 4 items.
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Efficient algorithms for three reachability problems in safe Petri nets (Q2117182) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account (Q5100747) (← links)