Consider two multi server FCFS, exponential service stations connected in tandem, each with two servers. The first station has a capacity of 3 whereas the second has a capacity of 2. (Here capacity...

Consider two multi server FCFS, exponential service stations connected in tandem, each with two servers. The first station has a capacity of 3 whereas the second has a capacity of 2. (Here capacity refers to the number of customers allowed at the station.) If a customer cannot move to the second station because of capacity limitation, it stays at station 1. Customers come from outside to station 1 according to a Poisson process. If a customer cannot get into station I, it blocks for an exponential amount of time in station 1's queue and tries again. (Blocked customers do not need any attention from the server but do hold up positions in the "waiting room" .) Construct a GSPN model of this system and identify the Qf matrix for its embedded Markov chain. What difficulties do you encounter in solving this model? Suggest possible ways of overcoming them.