An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs

This publication has 7 references indexed in Scilit:

• Traces, histories, graphs: Instances of a process monoid
  Published by Springer Nature ,2005
• An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphs
  Published by Springer Nature ,1987
• On recognizable subsets of free partially commutative monoids
  Lecture Notes in Computer Science, 1986
• Maximal serializability of iterated transactions
  Theoretical Computer Science, 1985
• Recognizable subsets of some partially abelian monoids
  Theoretical Computer Science, 1985
• Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire
  RAIRO. Informatique théorique, 1985
• Words over a Partially Commutative Alphabet
  Published by Springer Nature ,1985