Ces automates sont utilises pour reconnaitre des sous-ensembles d'un monoide partiellement commutatif libre. On prouve qu'un sous-ensemble de ce monoide est reconnaissable par un de ces automates si et seulement s'il est reconnaissable par un automate fini

/pdf/notes-on-finite-asynchronous-automata-19h1q2wsfo.pdf

Notes on finite asynchronous automata

This thesis studies formal aspects of team automata, a mathematical framework introduced in 1997 by C.A. Ellis to model components of groupware systems and their interconnections.
We focus on the flexibility that team automata offer when modeling collaboration between system components

Team automata : a formal approach to the modeling of collaboration between system components

https://hal.inria.fr/inria-00141898/document

Residual for Component Specifications

Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which basic groupware notions can be rigorously defined and studied. At the architectural level, team automata can be used as building blocks in the design of groupware systems.

http://fmt.isti.cnr.it/~mtbeek/cscw03.pdf

C. Duboc

Papers

Mixed product and asynchronous automata