DOIAbstract
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of binary relations indicating when two events, in a given state of the automaton, are concurrent. We investigate concurrency monoidsM(A) comprising all finite computation sequences of A, modulo a canonical congruence induced by the concurrency relations, with composition as monoid operation. Under suitable assumptions on A we obtain a characterization of the star- free languages ofM(A). This generalizes a classical result of M. P. Schützenberger and a result of G. Guaiana, A. Restivo and S. Salemi in trace theory
Add to ORKG