シナリオ
Three jobs arrive and must be processed by Machine A then Machine B, with Machine A capacity 2 and Machine B capacity 1. The Petri net visualizes token flow and resource contention.
この図に含まれるもの
図の背後にある意思決定を読み解く。
01
Declared initial tokens for jobs and machines
02
Sequential handoff via intermediate place OnA
03
Finite capacity modeled via capacity limits on resource places
Use this pattern when modeling production lines, job shops, or any system with limited shared resources and precedence constraints. Helps identify bottlenecks and deadlocks.