Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3321292> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Q3321292 subject Q7020692.
- Q3321292 subject Q7142640.
- Q3321292 subject Q7451612.
- Q3321292 subject Q8471951.
- Q3321292 abstract "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 the concept of a string, by not forcing the letters to always be in a fixed order, but allowing certain reshufflings to take place. Traces were introduced by Cartier and Foata in 1969 to give a combinatorial proof of MacMahon's Master theorem. Traces are used in theories of concurrent computation, where commuting letters stand for portions of a job that can execute independently of one another, while non-commuting letters stand for locks, synchronization points or thread joins.The trace monoid or free partially commutative monoid is a monoid of traces. In a nutshell, it is constructed as follows: sets of commuting letters are given by an independency relation. These induce an equivalence relation of equivalent strings; the elements of the equivalence classes are the traces. The equivalence relation then partitions up the free monoid (the set of all strings of finite length) into a set of equivalence classes; the result is still a monoid; it is a quotient monoid and is called the trace monoid. The trace monoid is universal, in that all homomorphic monoids are in fact isomorphic.Trace monoids are commonly used to model concurrent computation, forming the foundation for process calculi. They are the object of study in trace theory. The utility of trace monoids comes from the fact that they are isomorphic to the monoid of dependency graphs; thus allowing algebraic techniques to be applied to graphs, and vice versa. They are also isomorphic to history monoids, which model the history of computation of individual processes in the context of all scheduled processes on one or more computers.".
- Q3321292 wikiPageExternalLink diekert97partial.html.
- Q3321292 wikiPageExternalLink cartfoa.html.
- Q3321292 wikiPageWikiLink Q1169754.
- Q3321292 wikiPageWikiLink Q1442189.
- Q3321292 wikiPageWikiLink Q1501387.
- Q3321292 wikiPageWikiLink Q165474.
- Q3321292 wikiPageWikiLink Q184524.
- Q3321292 wikiPageWikiLink Q189112.
- Q3321292 wikiPageWikiLink Q1970286.
- Q3321292 wikiPageWikiLink Q207348.
- Q3321292 wikiPageWikiLink Q208237.
- Q3321292 wikiPageWikiLink Q213092.
- Q3321292 wikiPageWikiLink Q215111.
- Q3321292 wikiPageWikiLink Q232661.
- Q3321292 wikiPageWikiLink Q4558715.
- Q3321292 wikiPageWikiLink Q574633.
- Q3321292 wikiPageWikiLink Q650462.
- Q3321292 wikiPageWikiLink Q6535335.
- Q3321292 wikiPageWikiLink Q6722024.
- Q3321292 wikiPageWikiLink Q7020692.
- Q3321292 wikiPageWikiLink Q7142640.
- Q3321292 wikiPageWikiLink Q7451612.
- Q3321292 wikiPageWikiLink Q7623989.
- Q3321292 wikiPageWikiLink Q8471951.
- Q3321292 wikiPageWikiLink Q849775.
- Q3321292 wikiPageWikiLink Q924044.
- Q3321292 comment "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 the concept of a string, by not forcing the letters to always be in a fixed order, but allowing certain reshufflings to take place. Traces were introduced by Cartier and Foata in 1969 to give a combinatorial proof of MacMahon's Master theorem.".
- Q3321292 label "Trace monoid".