Abstract
A strongly communicating sequential process is one that cannot execute for ever without communicating with its environment. The behaviour of parallel programs formed by simple networks of such processes can sometimes be described by binary relations, that are computed from the processes. Those relations yield rules that show how to find a non-deterministic sequential program "equivalent" to the original parallel program. Two examples illustrate the results presented.
Research reported herein was supported in part by the Calouste Gulbenkian Foundation, Lisbon, under grant number 14/78/B.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, N. Francez and W.P. de Roever, "Semantics for concurrently communicating finite sequential processes, based on predicate transformers". Univ. of Utrecht Progress Report, 1979.
K.R. Apt, N. Francez and W.P. de Roever, "A proof system for communicating sequential processes". TOPLAS 2,3, July 1980, pp. 359–385.
P. Cousot and R. Cousot, "Constructing program invariance proof methods". International Workshop on Program Construction, Ed. INRIA, September 1980.
E.W. Dijkstra, "A Discipline of Programming". Prentice Hall, 1976.
E.W. Dijkstra, "A correctness proof for communicating processes — a small exercise". EWD-607, 1977.
N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever, "Semantics of nondeterminism, concurrency and communication". JCSS 19,3, December 1979, pp. 290–308.
P. Guerreiro, "A relational model for non-deterministic programs and predicate transformers", in Fourth International Symposium on Programming, Lecture Notes in Computer Science 83. Springer 1980, pp. 136–146.
C.A.R. Hoare, "An axiomatic basis for computer programming". CACM 12, 10 October 1969, pp. 576–580, 583.
C.A.R. Hoare, "Communicating sequential processes". CACM 21, 8, August 1978, pp. 666–677.
C.A.R. Hoare, "A model for communicating sequential processes". Oxford Univ. Comp. Lab., July 1979.
A. van Lamsweerde and M. Sintzoff, "Formal derivation of strongly correct parallel programs". MBLE Research Lab. Report R 338, October 1976, also Acta Informatica 12, fasc. 1, 1979, pp. 1–31.
A. Mazurkiewicz, "Proving properties of processes". Algorytmy, XI, no 19, 1974, pp. 5–22.
G. Milne and R. Milner, "Concurrent processes and their syntax". JACM, 26, 2, April 1979, pp. 302–321.
S. Owicki and D. Gries, "Verifying properties of parallel programs: an axiomatic approach". CACM 19, 5, May 1976, pp. 279–285.
W.P. de Roever, "Dijkstra's predicate transformer, non-determinism, recursion and termination", in Math. Found. of Comp. Sci., Lecture Notes in Computer Science 45. Springer, 1976, pp. 472–481.
J. Sifakis, "Le contrôle des systèmes asynchrones: concepts, propriétés, analyse statique". Thèse d'Etat, Univ. of Grenoble, June 1979.
J. Sifakis. "A unified approach for studying the properties of transition systems", RR 179, IMAG, Grenoble, December 1979 (to appear in TCS).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guerreiro, P. (1981). Relational semantics of strongly communicating sequential processes. In: DÃaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_107
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive