Skip to main content
SpringerLink
Log in

In Scott-Strachey style denotational semantics, parallelism implies nondeterminism

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A minimum algebraic structure needed in Scott-Strachey style denotational semantics for parallel programs is developed. Some elementary algebra shows that nondeterministic semantics is inherently and uniquely present. Conversely, any simple nondeterministic semantics provides uniquely a semantics for a minimal parallel computation capability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chandra, Ashok K., Computable nondeterministic functions, Proc. 19th Symp. FoCS, Ann Arbor, 127–131 (1978).

  2. Dijkstra, Edsger W., A Discipline of Programming, Prentice-Hall, 1976.

  3. Francez, Nissim, C. A. R. Hoare, Daniel J. Lehmann, and Willem P. de Roever, Semantics of nondeterminism, concurrency, and communication,J. Comput. Sys. Sci. 19, 290–308 (1979).

    Google Scholar 

  4. Francez, Nissim, Daniel J. Lehmann, and A. Pnueli, A linear history semantics for distributed languages, IEEE Conf. Record of 21st FoCS Symp, 143–151 (1980).

  5. Gallier, J., Nondeterministic flow chart programs with recursive procedures: semantics and correctness,Theor. Comput. Sci. 13, 193–233 and 239–270 (1981).

    Google Scholar 

  6. Harel, David, First Order Dynamic Logic, Lecture Notes in Computer Science, Vol. 68, Springer-Verlag, New York, 1979.

    Google Scholar 

  7. Herrlich, Horst and George E. Strecker, Category Theory, 2d. edition, Heldermann-Verlag, Berlin, 1979.

    Google Scholar 

  8. Keller, Robert M., Denotational models for parallel programs with indeterminate operators,in Formal Description of Programming Concepts, E. J. Neuhold (ed.), North Holland, 337–366, 1978.

  9. Kosinski, Paul R., A straightforward denotational semantics for non-determinate data flow problems, Conf. Rec. 5th ACM Symp. Princ. Prog. Lang., Tucson, 214–221, 1978.

  10. Machtey, Michael and Paul Young, An Introduction to the General Theory of Algorithms, Elsevier North-Holland, 1978.

  11. Milne, George and Robin Milner, Concurrent processes and their syntax,J. Assoc. Comput. Mach. 26, 302–321 (1979).

    Google Scholar 

  12. Ogden, W. F., W. E. Riddle, and W. C. Rounds, Complexity of expressions allowing concurrency. Conf. Rec. 5th ACM Symp. Princ. Prog. Lang., Tucson, 185–194, 1978.

  13. Plotkin, G. D., A powerdomain construction.SIAMJ. Comput. 5, 452–487 (1976).

    Google Scholar 

  14. Scott, D., Data types as lattices.SIAMJ. Comput. 5, 522–587 (1976).

    Google Scholar 

  15. Smyth, M. B., Powerdomains,J. Comput. Sys. Sci. 16, 23–26 (1978).

    Google Scholar 

  16. Stoy. Joseph E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Washington State University, Pullman, Washington, USA

    David B. Benson

Authors
  1. David B. Benson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by National Science Foundation grants MCS77-08486 and MCS80-03433.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benson, D.B. In Scott-Strachey style denotational semantics, parallelism implies nondeterminism. Math. Systems Theory 15, 267–275 (1981). https://doi.org/10.1007/BF01786983

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01786983

Keywords

Search

Navigation