Decision problems concerning parallel programming

  • J. A. Bergstra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)


A notion of a correct (= deadlock free) scheduling of several recursive processes using common resources is introduced. The existence of correct schedulings is schown to be undecidable from recursive indices of the relevant processes. Further-more we isolate several cases where the more existence of a correct scheduling does not imply the existence of a computable (recursive) correct scheduling.


Parallel Programming Recursive Function Common Resource Recursive Process Recursion Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.A. Bergstra, Recursion theory on processes, Techn. Report Leiden, July 1977Google Scholar
  2. [2]
    H. Rogers, The theory of recursive functions and effective computability.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • J. A. Bergstra
    • 1
  1. 1.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenLeidenLeiden the Netherlands

Personalised recommendations