Trace monoid

Known as: Partially commutative free monoid, Trace, Trace language 
In computer science, a trace is a set of strings, wherein certain letters in the string are allowed to commute, but others are not. It generalizes… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids… (More)
Is this relevant?
2015
2015
We consider the problem of random uniform generation of traces (the elements of a free partially commutative monoid) in light of… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
The aim of this paper is to investigate the homology groups of mathematical models of concurrency. We study the Baues-Wirsching… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
A typical MapReduce cluster is shared among different users and multiple applications. A challenging problem in such shared… (More)
  • figure 1
  • figure 3
  • table I
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
∗ A preliminary (short) version of this manuscript appeared in the Proceedings of the International Conference on Intelli gent… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The height of a trace is the height of the corresponding heap of pieces in Viennot’s representation, or equivalently the number… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
* URLs: http://www.cs.vu.nl/{~jonker,~treur} Email addresses: {jonker, treur}@cs.vu.nl Abstract This paper addresses the dynamics… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
1997
1997
Place/Transition (PT) Petri nets are one of the most widely u sed models of concurrency. However, they still lack, in our view, a… (More)
Is this relevant?
1993
1993
  • Georg Schied
  • Dagstuhl Seminar on Graph Transformations in…
  • 1993
In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and… (More)
Is this relevant?
1991
1991
Rozoy, B. and P.S. Thiagarajan, Event structures and trace monoids, Theoretical Computer Science 91 (1991) 285-313. Event… (More)
  • figure 3
  • figure 5
  • figure 6
  • figure 8
  • figure 10
Is this relevant?