Pages that link to "Item:Q3552518"

The following pages link to ON THE EFFICIENT COMPUTATION OF THE MINIMAL COVERABILITY SET OF PETRI NETS (Q3552518):

Displaying 3 items.

• Synchronizing sequences on a class of unbounded systems using synchronized Petri nets (Q262433) (← links)
• Commodification of accelerations for the Karp and Miller construction (Q2058566) (← links)
• Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q3011882) (← links)