Top-down considerations on distributed computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1499, Issue , 1998, Pages 16-19

  Van Der Meyden, Ron ^a   Moses, Yoram ^b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947943884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056469     Document Type: Conference Paper

References (7)

1. Chou, C., Gafni, E.: Understanding and verifying distributed algorithms using stratified decomposition. Proc. 7th ACM PODC (1988) 44-65
2. Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Prog. Lang. and Syst., 5(1) (1983) 66-77
3. Elrad, T., Francez, N.: Decomposition of distributed programs into communication closed layers. Sci. Comp. Prog., 2(3) (1982) 155-173
4. Havelund, K., Larsen, K. G.: The fork calculus. Proc. 20th ICALP, LNCS 700 (1993) 544-557
5. Koo, R., Toueg, S.: Effects of message loss on termination of distributed protocols. Inf. Proc, Letters, 27 (1988) 181-188
6. Stomp, F., de Roever, W. P.: A principle for sequential reasoning about distributed systems. Form. Asp. Comp., 6(6) (1994) 716-737
7. Zweirs, J., Janssen, W.: Partial-order based design of concurrent systems. Proc. REX Syrup. "A decade of concurrency", J. de Bakker, W. P. de Roever, G. Rozenberg eds., LNCS 803 (1994) 622-684