Skip to main content
SpringerLink
Log in
Book cover

Abstract Software Specifications pp 504–526Cite as

On the semantics of fair parallelism

  • Parallellism & Non-Determinism
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 86))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of nondeterministic recursive programs. Rapport I.T.-3-78. Equipe Lilloise d'Informatique Theorique, 1978.

    Google Scholar 

  2. de Bakker, J.W.: Semantics and termination of nondeterministic recursive programs. pp 435–477 in Automata, Languages and Programming, ed. Michaelson, Milner, Edinburgh University Press, 1976.

    Google Scholar 

  3. de Bakker, J.W., de Roever, W.P.: A calculus for recursive program schemes, pp. 167–196 in Automata, Languages and Programming, ed. Nivat, North Holland 1973.

    Google Scholar 

  4. Dijkstra, E.W., A Discipline of Programming. Prentice-Hall, 1976.

    Google Scholar 

  5. Plotkin, G., A powerdomain construction. 452–487, SIAM J. Comp. 5 (1976).

    Article  Google Scholar 

  6. Hitchcock, P., Park, D., Induction rules and termination proofs. pp. 225–251 in Automata, Languages and Programming, ed. Nivat, North Holland 1973.

    Google Scholar 

  7. de Roever, W.P., Dijkstra's predicate transformer, nondeterminism, recursion and termination, in Mathematical Foundations of Computer Science, Springer Lecture Notes 45, 1976.

    Google Scholar 

  8. Smyth, M., Power domains. 23–26 J. Comp. Sys. Sci. 16 (1978)

    Article  Google Scholar 

  9. Tiuryn, J., Continuity problems in the power-set algebra of infinite trees. (presented at 4e Colloque de Lille, 1979), Warsaw, 1979.

    Google Scholar 

  10. Wadge, W.W.: An extensional treatment of dataflow deadlock. 285–299 in Semantics of Concurrent Computation, Springer Lecture Notes 70, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Warwick, CV4 7AL, Coventry, England

    David Park

Authors
  1. David Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjøorner

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, D. (1980). On the semantics of fair parallelism. In: Bjøorner, D. (eds) Abstract Software Specifications. Lecture Notes in Computer Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10007-5_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-10007-5_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10007-2

  • Online ISBN: 978-3-540-38136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation