Redes De Petri Ejercicios Resueltos !new! -

| 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 |

A transition ( t ) is enabled if each input place ( p ) has at least ( W(p,t) ) tokens. When fired, it removes ( W(p,t) ) tokens from each input place ( p ) and adds ( W(t,p') ) tokens to each output place ( p' ).

Inicialmente, marcadores en (P_3) y (P_4). redes de petri ejercicios resueltos

Model a two-step process: Step A must complete before Step B starts.

"Redes de Petri: Ejercicios prácticos resueltos" | Property | Meaning | How to verify

| Exercise Type | Key Modeling Pattern | |---------------|----------------------| | Sequence | Chain of place-transition-place | | Concurrency (Fork) | One transition → two output places | | Synchronization (Join) | Two input places → one transition | | Mutual Exclusion | Resource place + request-start-release pattern | | Bounded Buffer | Extra place counting free spaces | | Producer-Consumer | Buffer place + space place + separate control places |

P1 → T1 → P2 → T2 → P4 ↘ ↘ P3 → T3 → P5 → T4 When fired, it removes ( W(p,t) ) tokens

Puntos dentro de los lugares que indican que una condición se cumple en un momento dado. Ejercicio 1: Modelado de Exclusión Mutua