An Account of Implementing Applicative Term Rewriting
Muck van Weerdenburg · Electronic Notes in Theoretical Computer Science · 2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation of two rewriters of the mCRL2 toolset. These rewriters work on open terms and use nonlinear match trees. A comparison is made with other commonly used efficient rewriters.