Deadlock — This article is about the computer science concept. For other uses, see Deadlock (disambiguation). A deadlock is a situation where in two or more competing actions are each waiting for the other to finish, and thus neither ever does. It is often… … Wikipedia

Actor model and process calculi — In computer science, the Actor model and process calculi are two closely related approaches to the modelling of concurrent digital computation. See Actor model and process calculi history.There are many similarities between the two approaches,… … Wikipedia

Communicating sequential processes — In computer science, Communicating Sequential Processes (CSP) is a formal language for describing patterns of interaction in concurrent systems.[1] It is a member of the family of mathematical theories of concurrency known as process algebras, or … Wikipedia

Resource starvation — In computer science, starvation is a multitasking related problem, where a process is perpetually denied necessary resources. Without those resources, the program can never finish its task [] .Starvation is similar in effect to deadlock. Two or… … Wikipedia