i am not getting what you wanna say... but i will answer it.,... take n processes P1,P2,....Pn where pn is different than others
deadlock means all processes should be block, it can't be happened due to
if Pn is out side ====> it can enter at any time
if Pn is inside =====> 1) if No other process inside means Mutex =1 ===> No Problem
2) if Some other processes inside, those process make Mutex=1 when they excute their exit section
We are using semaphores, therefore we have queue ===> No Starvation
Several Processes executes Critical Section at a time..
assume P1 enters ===> Mutex =0 ===> except Pn no other process can enter
Pn enters ===> Mutex = 1
P2 enters ====> Mutex =0
All these three are in Critical section at a time...
P1 enter ,Pn enter, P2 enter , ----- P1 leave, Pn leave, ----- P1 enter, Pn enter, P3 enter repeat this process you can have many Processes in C.S.