Assignment 3 FSP

1
Assignment 3 - FSP
GE2. Consider the following scenario. There
are n bees and a hungry bear. They share a pot of
honey. The pot is initially empty its capacity
is H portions of honey. The bear waits until the
pot is full, eats all the honey and waits until
the pot is full again this pattern repeats
forever. Each bee repeatedly gathers one portion
of honey and puts it into the pot if the pot is
full when a bee arrives it must wait until the
bear has eaten the honey before adding its
portion this pattern repeats forever. Model
this scenario using FSP. The LTS graph for 4 bees
is shown below. Your FSP model must produce an
identical graph.
2
Assignment 3 - FSP
GE2.
3
Assignment 3 - FSP
GE2. Solution.
const H4 const N3 BEE (addhoney -gt
BEE). BEAR (eat -gt BEAR). POT
POT0, POTi0..H (when (iltH)
j0..N.addhoney -gt POTi1 when
(iH) eat -gt POT0). HONEYBEAR
(i0..NBEE BEAR POT).