As the number of processes and resources increases within a computer system, does the probability of that system's being in deadlock increase or decrease? This paper introduces Probabilistic Automata as a model of computer systems. This allows investigation of the above question for various scheduling algorithms. a theorem is proved which indicates that, within the types of systems considered, the probability of deadlock increases.
Ellis, Clarence A., "On the Probability of Deadlock in Computer Sciences ; CU-CS-026-73" (1973). Computer Science Technical Reports. 25.