## Representation of Computations in Concurrent Automata by Dependence Orders (1997)

Venue: | THEORETICAL COMP. SCIENCE |

Citations: | 7 - 2 self |

### BibTeX

@TECHREPORT{Bracho97representationof,

author = {Felipe Bracho and Manfred Droste and Dietrich Kuske},

title = {Representation of Computations in Concurrent Automata by Dependence Orders},

institution = {THEORETICAL COMP. SCIENCE},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

An automaton with concurrency relations A is a labeled transition system with a collection of binary relations indicating when two actions in a given state of the automaton can occur independently of each other. The concurrency relations induce a natural equivalence relation for finite computation sequences. We investigate two graph-theoretic representations of the equivalence classes of computation sequences and obtain that under suitable assumptions on A they are isomorphic. Furthermore, the graphs are shown to carry a monoid operation reflecting precisely the composition of computations. This generalizes fundamental graph-theoretical representation results due to Mazurkiewicz in trace theory.