Pomsets for local trace languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Fundamenta Informaticae
| Hi-index | 5.23 |
We investigate an operational model of concurrent systems, calledautomata with concurrency relations. These are labelled transitionsystems A in which the event set is endowed with a collectionof binary concurrency relations which indicate when two events, in aparticular state of the automaton, commute. This model generalizesasynchronous transition systems, and as in trace theory we obtain,through a permutation equivalence for computation sequences ofA, an induced domain DA,≤. Here, we construct a categorical equivalence betweena large category of (“cancellative”) automata withconcurrency relations and the associated domains. We show that eachcancellative automaton can be reduced to a minimal cancellativeautomaton generating, up to isomorphism, the same domain. Furthermore,when fixing the event set, this minimal automaton is unique.—Authors' Abstract