2000 character limit reached
Representation of traces by vectors of words
Published 10 May 2015 in cs.DM | (1505.02403v2)
Abstract: We show that every trace monoid is isomorphic to a sub-monoid of a monoid of word vectors. It provides a concrete representation of the elements of a trace monoid as processes associated with a resource sharing mechanism. We illustrate this representation by obtaining some results on the ordering structure of the left divisibility relation on trace monoids.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.