Langages persistants
RAIRO. Informatique théorique, Tome 18 (1984) no. 3, pp. 259-278. 
@article{ITA_1984__18_3_259_0,
     author = {Alaiwan, A.},
     title = {Langages persistants},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {259--278},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {3},
     year = {1984},
     mrnumber = {763670},
     zbl = {0541.68050},
     language = {fr},
     url = {http://archive.numdam.org/item/ITA_1984__18_3_259_0/}
}
TY  - JOUR
AU  - Alaiwan, A.
TI  - Langages persistants
JO  - RAIRO. Informatique théorique
PY  - 1984
SP  - 259
EP  - 278
VL  - 18
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1984__18_3_259_0/
LA  - fr
ID  - ITA_1984__18_3_259_0
ER  - 
%0 Journal Article
%A Alaiwan, A.
%T Langages persistants
%J RAIRO. Informatique théorique
%D 1984
%P 259-278
%V 18
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1984__18_3_259_0/
%G fr
%F ITA_1984__18_3_259_0
Alaiwan, A. Langages persistants. RAIRO. Informatique théorique, Tome 18 (1984) no. 3, pp. 259-278. http://archive.numdam.org/item/ITA_1984__18_3_259_0/

1. A. Arnold et M. Nivat, Comportements de processus, Rapport L.I.T.P. 82-12, février 1912.

2. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974. | MR | Zbl

3. R. M. Karp et R. E. Miller, Parallel Program Schemata, J. Computer System Science, vol. 3, 1969, p. 147-195. | MR | Zbl

4. R. M. Keller, Vector Replacement Systems; a Formalism for Modeling Asynchronous Systems; technical Report 117, Pinceton Univ., 1972.

5. R. J. Lipton, R. E. Miller et L. Snyder, Synchronization and Computing Capabilities of Linear Asynchronous Structures, Proc. 16th Ann. Symp. on F.O.C.S., I.E.E.E. Computer Society, 1975, p. 19-22.

6. E. Mayr, Persistence of Vector Replacement Systems is Decidable, Acta Informatica, vol. 15, 1981, p. 309-318. | MR | Zbl

7. D. E. Muller et M. S. Bantky, A Theory of Asynchronous Circuits, Proc. Int. Symp. on Theory of Switching, Cambridge M. A. : Harvard, Univ. Press, 1959, p. 207-243. | MR | Zbl

8. B. Rosen, Tree Manipulating Systems and Church Rosser Theorems, J. Assoc. Comput. Mach., vol. 20, 1973, p. 160-187. | MR | Zbl

9. H. Yamasaki, On Weak Persistency of Petri Nets, Information Process Letters, vol. 3, n° 3, décembre 1981. | MR | Zbl