An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.
['Mw Maciej Gazda', 'Wan Fokkink']
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics