scientific article; zbMATH DE number 4047130

MaRDI QIDQ3783583zbMATH OpenFDO

Authors Yves Métivier

Publication date 1987

zbMATH Keywords

asynchronous automatonpartially commutative monoidrecognizable set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 871239
• An extension of the notions of traces and of asynchronous automata
• On commutative asynchronous nondeterministic automata
• A quadratic construction for Zielonka automata with acyclic communication structure
• Probabilistic asynchronous automata

Cited in

(5)

• A quadratic construction for Zielonka automata with acyclic communication structure
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• 2-asynchronous automata
• Compositional synthesis of asynchronous automata
• Time-stamps for Mazurkiewicz traces.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783583)