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

A simple realization of a parallel device recognizing regular trace languages

CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation

Time-stamps for Mazurkiewicz traces

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

Distributed Asynchronous Automata

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory

Optimal Zielonka-type construction of deterministic asynchronous automata

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Compositional synthesis of asynchronous automata

Theoretical Computer Science

Unfolding synthesis of asynchronous automata

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

A NOTE ON MÉTIVIER'S CONSTRUCTION OF ASYNCHRONOUS AUTOMATA FOR TRIANGULATED GRAPHS

Fundamenta Informaticae

Note: A quadratic construction for Zielonka automata with acyclic communication structure

Theoretical Computer Science