This research defines a new format called extended tyft/tyxt format. This format is able to express process algebras with structured or non-atomic labels and their bisimulation-based semantic equivalences. A general notion of bisimulation is a congruence for this format, under reasonable technical conditions. The aim of this format is to allow the comparison of bisimulation-based semantic equivalences and to this end, this paper defines a number of extensions and gives results showing conditions required to achieve the extensions. This paper also discusses the process algebras that can be expressed in this format and presents a new semantic equivalence comparison result for multiprocessor bisimulation and pomset bisimulation.