An extension of the notions of traces and of asynchronous automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 4, pp. 355-393. 
@article{ITA_1991__25_4_355_0,
     author = {Arnold, A.},
     title = {An extension of the notions of traces and of asynchronous automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {355--393},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {4},
     year = {1991},
     mrnumber = {1134387},
     zbl = {0765.68153},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1991__25_4_355_0/}
}
TY  - JOUR
AU  - Arnold, A.
TI  - An extension of the notions of traces and of asynchronous automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 355
EP  - 393
VL  - 25
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1991__25_4_355_0/
LA  - en
ID  - ITA_1991__25_4_355_0
ER  - 
%0 Journal Article
%A Arnold, A.
%T An extension of the notions of traces and of asynchronous automata
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 355-393
%V 25
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1991__25_4_355_0/
%G en
%F ITA_1991__25_4_355_0
Arnold, A. An extension of the notions of traces and of asynchronous automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 4, pp. 355-393. http://archive.numdam.org/item/ITA_1991__25_4_355_0/

1. J. J. Aalsberg, G. Rozenberg, Theory of traces. Technical Report 86-16, Institute of Applied Mathematics and Computer Science, University of Leiden, 1986.

2. R. Cori, Y. Métivier, Approximation of a trace, asynchronous automata, and the ordering of events in a distributed system. In Lepistö and Salomaa, editors, 15th I.C.A.L.P., pp. 147-161, Lecture Notes Comput. Sci., 317, 1988. | MR | Zbl

3. R. Cori, D. Perrin, Automates et commutations partielles, R.A.I.R.O. Inform. Théor. Appl., 1985,19, pp. 21-32. | Numdam | MR | Zbl

4. P. Degano, U. Montanari, Specification languages for distributed Systems. In H. EHRIG, C. FLOYD, M. NIVAT, J. THATCHER, Eds., Mathematical Foundations of Software Development (TAPSOFT'85), pp. 29-51, Lecture Notes Comput. Sci., 185, 1985. | MR | Zbl

5. U. Goltz, W. Reisig, The non-sequential behaviour of Petri nets, Inform. and Control, 1983, 57, pp. 125-147. | MR | Zbl

6. J. Grabowski, On partial languages, Fundamenta Informaticae, 1981, IV, 2, pp. 427-498. | MR | Zbl

7. A. Mazurkiewicz, Traces, histories, and graphs: Instances of process monoids, In M. CHYTIL, V. KOUBEK Eds., MFCS'84, pp. 115-133, Lecture Notes Comput. Sci., 176, 1984. | MR | Zbl

8. A. Mazurkiewicz, Compositional semantics of pure place/transition systems, Fund. Inform., XI, 1988. | MR

9. A. Mazurkiewicz, Concurrency, modularity, and synchronization. In A. KRECZMAR, G. MIRKOWSKA Eds., MFCS'89, pp. 577-598, Lecture Notes Comput. Sci., 379, 1989. | MR | Zbl

10. Y. Métivier, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. R.A.I.R.O. Inform. Théor.Appl., 1985, 19, pp. 121-127. | Numdam | MR | Zbl

11. M. Nielsen, G. Plotkin, G. Winskel, Petri nets, event structures and domains, Theoret. Comput. Science, 1981, 13, pp. 85-108. | MR | Zbl

12. E. Ochmanski, Regular behaviour of concurrent systems, Bulletin EATCS, 1985, 27, pp. 56-67.

13. A. Rabinovich, B. A. Trakhtenbrot, Behavior structures and nets, Fund, Inform., XI, 1988, pp. 357-404. | MR | Zbl

14. B. Rozoy, Un modèle de parallélisme : le monoïde distribué, Thèse d'État, Université de Caen, 1987.

15. E. Szpilrajn, Sur l'extension de l'ordre partiel, Fund. Math., 1930, 16, pp. 386-389. | JFM

16. J. Winkowski, Behaviours of concurrent Systems, Theoret. Comput. Sci., 1980, 12, pp. 39-60. | MR | Zbl

17. J. Winkowski, An algebraic description of System behaviours, Theoret. Comput. Sci., 1982, 21, pp. 315-340. | MR | Zbl

18. W. Zielonka, Notes on finite asynchronous automata, R.A.I.R.O. Inform. Théor. Appl., 1987, 21, pp. 99-135. | Numdam | MR | Zbl