Projekt A3 - Reduktionssysteme für partiell-kommutative Monoide
Recently partially commutative monoids are getting a lot of attention
from computer scientists, since these monoids are useful in studying
problems of concurrency control. Accordingly, combinatorial and
computational problems for partially commutative monoids are being
studied. We are in particular interested in rewriting systems on
partially commutative monoids, the so-called trace-rewriting systems.