Cooperating sequential processes

By E. Dijkstra. 2002

771 citations recorded by the source corpus.

Subfields: Management Information Systems

View Paper: https://www.semanticscholar.org/paper/cd46e66972b056719a988e5c25440ab796c3f2f2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Management Information Systems

Citations in the corpus

Principles of model checking (2008, background): “He also introduced the concept of semaphores [127] and their use for solving the mutual exclusion problem.”
Permission accounting in separation logic (2005, background): “Since Dijkstra [9] the description of safe concurrency has been based on a separation of variables into distinct groups:”
Deadlock Control of Automated Manufacturing Systems Based on Petri Nets—A Literature Review (2012, background): “, a resource allocation and deadlock-avoidance algorithm [52] for operating sys-”
Conflict Resolution in Free-Ranging Multivehicle Systems: A Resource Allocation Paradigm (2011, methodology): “More specifically, Section V provides a customized instantiation of Banker’s algorithm [15] for the considered problem context.”
A view of 20th and 21st century software engineering (2006, methodology): “More careful organization of code was exemplified by Dijkstra’s famous letter to ACM Communications , “Go To Statement Considered Harmful” [56].”
Kodkod: A Relational Model Finder (2007, methodology): “We compared Kodkod to Alloy 3 on three design problems: Dijkstra’s mutual exclusion scheme [38], leader election in a ring [39], and the transfer protocol of the Mondex smart card [40].”
Giotto: a time-triggered language for embedded programming (2001, background): “In the latter case, semaphores [Dij65], monitors [Hoa74], or message queues are normally used.”
Synchronization (2018, neutral): “The study of synchronization began in earnest with Dijkstra’s “Cooperating Sequential Processes” monograph of 1965 [5].”
Resources, Concurrency and Local Reasoning (2004, background): “In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs should be designed so that diﬀerent processes behave independently, except at rare moments of synchronization [3].”
A Survey and Analysis of Multi-Robot Coordination (2013, neutral): “A well-known case of a general resource conflict problem is the mutual exclusion problem [52] in distributed computing systems or multi-access networks, where only a single resource is available.”