Given any amalgam [S1,S2;U][S1,S2;U] of inverse semigroups, we show how to construct an amalgam [T1,T2;Z][T1,T2;Z] such that S1∗US2S1∗US2 is embedded into T1∗ZT2T1∗ZT2, where S1⊆T1S1⊆T1, S2⊆T2S2⊆T2, S1∩Z=S2∩Z=US1∩Z=S2∩Z=U and, for any z∈Zz∈Z and h∈E(Ti)h∈E(Ti) with z≥hz≥h in TiTi, where i∈{1,2}i∈{1,2}, there exists f∈E(Z)f∈E(Z) with z≥f≥hz≥f≥h in TiTi; that is, ZZ is a lower bounded subsemigroup of T1T1 and T2T2. A recent paper by the author describes the Schützenberger automata of T1∗ZT2T1∗ZT2, for an amalgam [T1,T2;Z][T1,T2;Z] where ZZ is lower bounded in T1T1 and T2T2, giving conditions for T1∗ZT2T1∗ZT2 to have decidable word problem. Thus we can study S1∗US2S1∗US2 by considering T1∗ZT2T1∗ZT2. As an example, we generalize results by Cherubini, Jajcayová, Meakin, Piochi and Rodaro on amalgams of finite inverse semigroups.