MODELS OF CONCURRENT ARCHITECTURES - Modelling with Generalised Stochastic Petri Nets - page 250

End of requests
from neighbours

p ext req 1 Requests from

neighbours

p loc rdy

p ext req 2

t start req 1 t start req 2

T loc ex p req exe 1 p req exe 2

p ext acc

T end 1 T end 2

Requests to
neighbours

End of
requests

t ext acc 1

t ext acc 2

Figure 11.3: Simplified GSPN model of the behaviour of a processor in the
case of preemptive interaction and no multitasking

p ext req 1

End of requests
from neighbours

Requests from
neighbours

p loc rdy

p ext req 2

t start req 1 t start req 2

T loc ex p req exe 1 p req exe 2

p ext acc

T end 1 T end 2

Requests to
neighbours

End of
requests

t ext acc 1

t ext acc 2

Figure 11.4: Simplified GSPN model of the behaviour of a processor in the
case of non-preemptive interaction and no multitasking