Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 34-44 |
Journal | The Computer Journal |
Volume | 56 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2013 |