Distributing automata for asynchronous networks of processors

Journal Europeen des Systemes Automatises

Volumn 31, Issue 3, 1997, Pages 503-524

  Caillaud, Benoît ^a,d,e,f   Caspi, Paul ^b,g   Girault, Alain ^c,e,h,i   Jard, Claude ^d,g,j  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b VERIMAG   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d CAMPUS DE BEAULIEU   (France)

^e INRIA   (France)

^f UNIVERSITÉ DE RENNES 1   (France)

^g CNRS   (France)

^h BIP Team   (France)

ⁱ GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

^j PAMPA Research Team   (United States)

more..

Author keywords

Distribution; Order automata; Processor networks; Reactive systems; Semi commutations

Indexed keywords

EID: 0013220805     PISSN: 12696935     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. C. Kant Antonescu. Synthèse de spécifications de protocoles à partir de spécifications de service. PhD Thesis, University of Montréal, Montréal, Canada, March 1993.
2. K.R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
3. F. André, J.-L. Pazat, and H. Thomas. Pandore: a system to manage data distribution. In International Conference on Supercomputing. ACM, June 1990.
4. I.J. Aalbersberg and G. Razenberg. Theory of traces. Theoretical Computer Science, 60:1-82, 1988.
5. G. Berry and A. Benveniste. The synchronous approach to reactive and real-time systems. Proceedings of the IEEE, 79(9): 1270-1282, September 1991.
6. C. Bareau, B. Caillaud, C. Jard, and R. Thoraval. Correctness of automated distribution of sequential programs. In A. Bode, M. Reeve, and G. Wolf, editors, 5th Internationnal PARLE Conference, volume 694 of LNCS, pages 517-528, Munich, Germany, June 1993. Springer-Verlag.
7. A.J. Berstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, 15, October 1966.
8. G. Berry. Real time programming: Special purpose or general purpose languages. Information Processing, 89:11-18, 1989. G.X. Ritter (Ed.), Elsevier Science Publishers B.V. (North Holland).
9. B. Caillaud. Contribution à la modélisation du SPMD : distribution asynchrone d'automates. PhD Thesis, IFSIC / University of Rennes I, Rennes, France, June 1994.
10. P. Caspi, A. Girault, and D. Pilaud. Distributing reactive systems. In Seventh International Conference on Parallel and Distributed Computing Systems, PDCS'94, Las Vegas, USA, October 1994. ISCA.
11. D. Callahan and K. Kennedy. Compiling programs for distributed memory multiprocessors. Journal of Supercomputing, 2(2):151-169, June 1988. Tokyo, Japan.
12. M. Clerbout and M. Latteux. Semi-commutations. Information and Computation, 73:59-74, 1987.
13. R. Cori and Y. Métivier. Recognizable subsets of partially abelian monoids. Theoretical Computer Science, 35:179-189, 1985.
14. A. Girault. Sur la répartition de programmes synchrones. PhD Thesis, INPG, Grenoble, France, January 1994.
15. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous data flow programming language LUSTRE. Proceedings of the IEEE, 79(9): 1305-1320, September 1991.
16. R.P. Hopkins. Distributable nets. In G. Rozenberg, editor, 11th International Conference on Applications and Theory of Petri Nets, APN'91, volume 524 of LNCS, pages 161-187, Paris, France, June 1991. Springer-Verlag.
17. J.R. Kennaway, J. W. Klop, M.R. Sleep, and F.J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 119(1):18-28, 1995.
18. A. Mazurkiewicz. Trace theory. In Advanced Course on Petri Nets, volume 255 of LNCS, pages 279-324. Springer-Verlag, 1986.
19. E. Ochmański. Semi-commutations for place/trasition systems. Bulletin of the European Association for Theoretical Computer Science, 38:191-198, 1989.
20. A. Petit. Recognizable trace languages, distributed automata and the distribution problem. Acta Informatica, 30(1): 89-10, 1993.
21. V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1), November 1986.
22. K. Saleh and R. Probert. A service-based method for the synthesis of communications protocols. International Journal of Mini and Microcomputers, 12(3):97-103, 1990.
23. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. Theoretical Informatics and Applications, 21(2):99-135, 1987.