论文信息 - Modeling the distributed termination convention of CSP

Modeling the distributed termination convention of CSP

On montre comment la convention de terminaison repartie des commandes repetitives de CSP peut etre modelee en utilisant d'autres constructions de CSP. La transformation presentee suggere une simple implementation de cette convention

Nissim Francez | Krzysztof R. Apt | K. Apt | N. Francez

[1] Krzysztof R. Apt,et al. Formal Justification of a Proof System for Communicating Sequential Processes , 1983, JACM.

[2] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[3] Abraham Silberschatz,et al. An Effective Implementation for the Generalized Input-Output Construct of CSP , 1983, TOPL.

[4] Ernst-Rüdiger Olderog,et al. Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[5] Arthur J. Bernstein,et al. Output Guards and Nondeterminism in “Communicating Sequential Processes” , 1980, TOPL.

[6] BernsteinArthur. Output Guards and Nondeterminism in Communicating Sequential Processes , 1980 .

[7] FrancezNissim,et al. Modeling the distributed termination convention of CSP , 1984 .

[8] Abraham Silberschatz,et al. Comments on “Communicating Sequential Processes” , 1979, TOPL.

[9] Nissim Francez,et al. Distributed Termination , 1980, TOPL.

[10] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11] Elena Zucca,et al. Semantics of CSP via Translation into CCS , 1981, MFCS.

[12] Willem P. de Roever,et al. A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..