A protocol synthesis technique for developing the protocol derivation algorithm, by using a state-transition model is presented. A state-transition model, which can easily describe a service containing an infinite number of possible execution paths by using transition loops in finite state machines (FSM) and which seems to be a more natural and better understood model. An error-recovery transformation procedure to fix the sink-state and duplicate acceptance problems is deviced.