• Publications
  • Influence
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1 December 1959
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. Expand
  • 19,642
  • 912
  • PDF
A Discipline of Programming
  • 4,897
  • 260
  • PDF
Self-stabilizing systems in spite of distributed control
  • E. Dijkstra
  • Computer Science, Mathematics
  • CACM
  • 1 November 1974
The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation "the system is in a legitimate state" invariant. Expand
  • 2,203
  • 131
  • PDF
Guarded commands, nondeterminacy and formal derivation of programs
So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. Expand
  • 1,926
  • 75
  • PDF
Predicate Calculus and Program Semantics
This text gives a self-contained foundation of predicate transformer semantics by making extensive use of the predicate calculus. Expand
  • 764
  • 64
Solution of a problem in concurrent programming control
A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the "critical section" of its cycle. Expand
  • 761
  • 56
  • PDF
Notes on structured programming
• A submitted manuscript is the version of the article upon submission and before peer-review. Expand
  • 1,014
  • 38
  • PDF
Termination Detection for Diffusing Computations
This invention relates to an electronically rotatable antenna which includes several radially arranged Yagi antennae having a common drive element. Expand
  • 778
  • 37
Cooperating sequential processes
This chapter is intended for all those who expect that in their future activities they will become seriously involved in the problems that arise in either the design or the more advanced applications of digital information processing equipment; they are further intended for those who are just interested in information processing. Expand
  • 740
  • 33
Hierarchical ordering of sequential processes
An analysis of the requirements of the correctness proofs will give us an insight into the logical issues at hand.SummaryOne of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic into a deterministic automaton. Expand
  • 490
  • 23