Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Reference
J.A. Bergstra, Recursion theory on processes, Techn. Report Leiden, July 1977
H. Rogers, The theory of recursive functions and effective computability.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergstra, J.A. (1978). Decision problems concerning parallel programming. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_62
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08921-6
Online ISBN: 978-3-540-35757-5
eBook Packages: Springer Book Archive