Patched: Redes De Petri Ejercicios Resueltos

Un sistema de producción tiene dos máquinas (M1 y M2) y un buffer para almacenar productos en proceso. Inicialmente, hay un producto en el buffer.

T1 fires → tokens in P2 and P3 → T2 and T3 can fire independently (in any order or simultaneously). redes de petri ejercicios resueltos

| Property | Meaning | How to verify | |----------|---------|----------------| | | Places don’t accumulate infinite tokens | Maximum token count per place is finite | | Liveness | No deadlock; every transition can eventually fire | Check for circular dependencies | | Reachability | Can a certain marking be reached? | Reachability graph | | Safeness | Special case of boundness (max 1 token per place) | Inspect initial marking and firing rules | | Home state | Can return to initial marking? | Look for cycles in reachability graph | Un sistema de producción tiene dos máquinas (M1