Many process algebras are defined by structural operational semantics
(SOS). Indeed, most such definitions are nicely structured and fit the
GSOS format of Bloom et al. (J. Assoc. Comput. Mach., to appear). We
give a procedure for converting any GSOS language definition to a fini
te complete equational axiom system (possibly with one infinitary indu
ction principle) which precisely characterizes strong bisimulation of
processes. (C) 1994 Academic Press, Inc.