Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,059 papers from all fields of science
Search
Sign In
Create Free Account
Trace monoid
Known as:
Partially commutative free monoid
, Trace
, Trace language
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Communicating sequential processes
Compact semigroup
Dependency relation
Free monoid
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Play It Again, SimMR!
Abhishek Verma
,
L. Cherkasova
,
R. Campbell
IEEE International Conference on Cluster…
2011
Corpus ID: 13893770
A typical MapReduce cluster is shared among different users and multiple applications. A challenging problem in such shared…
Expand
2011
2011
Determination of the amphetamine-like designer drugs methcathinone and 4-methylmethcathinone in urine by LC-MS/MS
D. Grueninger
,
R. Englert
2011
Corpus ID: 55617644
Purpose: Beta-keto amphetamines are a new generation of designer drugs which have gained popularity among abusers in the last…
Expand
2011
2011
An On-Chip AHB Bus Tracer With Real-Time Compression and Dynamic Multiresolution Supports for SoC
Fu-Ching Yang
,
Yi-Ting Lin
,
Chung-Fu Kao
,
Ing-Jer Huang
IEEE Transactions on Very Large Scale Integration…
2011
Corpus ID: 13116738
This paper proposes a multiresolution AHB on-chip bus tracer named SYS-HMRBT (aHb multiresolution bus tracer) for versatile…
Expand
2002
2002
A dynamic perspective on an agent's mental states and interaction with its environment
C. Jonker
,
Jan Treur
Adaptive Agents and Multi-Agent Systems
2002
Corpus ID: 18070133
This paper contributes a formalised foundation of the dynamics of an agent's mental states in relation to the dynamics of its…
Expand
1994
1994
Gossiping, Asynchronous Automata and Zielonka's Theorem
M. Sohoni
1994
Corpus ID: 16724244
In this paper, we rst tackle a natural problem from distributed computing, involving time-stamps. We then show that our solution…
Expand
1992
1992
Decidability of the Star Problem in A* x {b}*
P. Gastin
,
E. Ochmanski
,
A. Petit
,
Brigitte Rozoy
Information Processing Letters
1992
Corpus ID: 40983758
1991
1991
Overlaps in Free Partially Commutative Monoids
F. Otto
,
C. Wrathall
Journal of computer and system sciences (Print)
1991
Corpus ID: 2569209
1988
1988
On Morphisms of Trace Monoids
E. Ochmanski
Symposium on Theoretical Aspects of Computer…
1988
Corpus ID: 39852502
Morphisms of trace monoids are studied in the paper. Their relations to morphisms of free monoids are described. Injective trace…
Expand
1987
1987
Rewriting Systems and Word Problems in a Free Partially Commutative Monoid
R. V. Book
,
Hai-Ning Liu
Information Processing Letters
1987
Corpus ID: 20636686
1985
1985
The trace specification of communications protocols
D. Hoffman
IEEE transactions on computers
1985
Corpus ID: 25073890
A methodology for the formal specification of communications protocols is described. Communications protocol software offers…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE