Langages persistants
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 3, page 259-278
- ISSN: 0988-3754
Access Full Article
top
How to cite
topAlaiwan, A.. "Langages persistants." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.3 (1984): 259-278. <http://eudml.org/doc/92211>.
@article{Alaiwan1984,
author = {Alaiwan, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {parallel computation; persistency},
language = {fre},
number = {3},
pages = {259-278},
publisher = {EDP-Sciences},
title = {Langages persistants},
url = {http://eudml.org/doc/92211},
volume = {18},
year = {1984},
}
TY - JOUR
AU - Alaiwan, A.
TI - Langages persistants
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 3
SP - 259
EP - 278
LA - fre
KW - parallel computation; persistency
UR - http://eudml.org/doc/92211
ER -
References
top- 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. Zbl0317.94045MR530382
- 3. R. M. KARP et R. E. MILLER, Parallel Program Schemata, J. Computer System Science, vol. 3, 1969, p. 147-195. Zbl0198.32603MR246720
- 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. Zbl0368.02038
- 6. E. MAYR, Persistence of Vector Replacement Systems is Decidable, Acta Informatica, vol. 15, 1981, p. 309-318. Zbl0454.68048MR625168
- 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. Zbl0171.37902MR114698
- 8. B. ROSEN, Tree Manipulating Systems and Church Rosser Theorems, J. Assoc. Comput. Mach., vol. 20, 1973, p. 160-187. Zbl0267.68013MR331850
- 9. H. YAMASAKI, On Weak Persistency of Petri Nets, Information Process Letters, vol. 3, n° 3, décembre 1981. Zbl0473.68058MR645451
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.