Zusammenfassung
A DP program consists of a fixed number of concurrent and persistent processes, that are started simultaneously. We assume the processes as being numbered, hence the program is denoted as (P1 ||... || Pn), n≥ 2. A process does not contain parallel statements, nor shared variables. The syntax of a process is as follows:
-
process <name>
-
<private variables>
-
<common procedures>
-
<initial statement>
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Literature references in this section
Apt, K.R., Ten years of Hoare logic, to appear.
Clint, M., 1973, Program proving: Coroutines, Acta Inf. 2, p. 50–63.
Owicki, S., D. Gries, 1976, An Axiomatic Proof Technique for Parallel Programs I, Acta Inf. 6, p. 319–340.
Roncken, M., N. van Diepen, M. Kramer, W.P. de Roever, 1981, A Proof System for Brinch Hansen’s Distributed Processes, Technical Report.
Further ideas of the proof system may be found in
Apt, K.R., N. Francez, W.P. de Roever, 1980, A Proof System for Communicating Sequential Processes, Toplas 2–3, p. 359–385.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Roncken, M., Gerth, R., de Roever, W.P. (1981). A Proof System for Brinch Hansen’s Distributed Processes. In: Brauer, W. (eds) GI — 11. Jahrestagung. Informatik-Fachberichte, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01089-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-01089-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10884-9
Online ISBN: 978-3-662-01089-1
eBook Packages: Springer Book Archive