A main concern, already addressed by the research community, relates to the verification of Conversation Protocol (CP) realizability, which means the existence of a set of peers whose communication behavior is equivalent to a given conversation protocol.In this paper, we consider the incremental repairability of CPs identified as un-realizable using the set of composition operators, defined in that satisfy suficient conditions for realizability preservation. Reparation consists in identifying a set of changes completing intermediate un-realizable CPs so that the resulting CP becomes realizable. Our proposal is validated through a successful application of the presented approach on un-realizable CPs borrowed from the literature.