Recherche et téléchargement d’archives de revues mathématiques numérisées

 
 
  Table des matières de ce fascicule | Article précédent
Arnold, A.
An extension of the notions of traces and of asynchronous automata. Informatique théorique et applications, 25 no. 4 (1991), p. 355-393
Texte intégral djvu | pdf | Analyses MR 1134387 | Zbl 0765.68153 | 1 citation dans Numdam

URL stable: http://www.numdam.org/item?id=ITA_1991__25_4_355_0

Bibliographie

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 1023633 |  Zbl 0656.68060
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 795769 |  Zbl 0601.68055
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 818014 |  Zbl 0563.68019
5. U. GOLTZ, W. REISIG, The non-sequential behaviour of Petri nets, Inform. and Control, 1983, 57, pp. 125-147.  MR 742704 |  Zbl 0551.68050
6. J. GRABOWSKI, On partial languages, Fundamenta Informaticae, 1981, IV, 2, pp. 427-498.  MR 645249 |  Zbl 0468.68088
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 783441 |  Zbl 0577.68061
8. A. MAZURKIEWICZ, Compositional semantics of pure place/transition systems, Fund. Inform., XI, 1988.  MR 982497
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 1036835 |  Zbl 0755.68098
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 860764 |  Zbl 0599.20107
11. M. NIELSEN, G. PLOTKIN, G. WINSKEL, Petri nets, event structures and domains, Theoret. Comput. Science, 1981, 13, pp. 85-108.  MR 593865 |  Zbl 0452.68067
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 982498 |  Zbl 0657.68068
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.
Article |  JFM 56.0843.02
16. J. WINKOWSKI, Behaviours of concurrent Systems, Theoret. Comput. Sci., 1980, 12, pp. 39-60.  MR 582241 |  Zbl 0445.68044
17. J. WINKOWSKI, An algebraic description of System behaviours, Theoret. Comput. Sci., 1982, 21, pp. 315-340.  MR 680920 |  Zbl 0493.68049
18. W. ZIELONKA, Notes on finite asynchronous automata, R.A.I.R.O. Inform. Théor. Appl., 1987, 21, pp. 99-135.
Numdam |  MR 894706 |  Zbl 0623.68055
Copyright Cellule MathDoc 2014 | Crédit | Plan du site