Computing the steady-state distribution of G-networks with synchronized partial flushing

We have shown in [5, 4, 3] that G-networks with synchronized partial flushing still have a product form steady-state distribution. These networks may have very complex dynamics where an arbitrary number of customers leave an arbitrary number of queues at the same time. The network How equation are non linear and the usual approaches to solve them fail. We, present here a new numerical algorithm which is based oil a transform of the G-network to a classical G-network with triggers. We show that the flow equation are transformed by a classical elimination procedure. This new result puts more emphasis on the importance of flow equations following the approach recently proposed by Gelenbe in [2].