Harmonious Cooperation of Processes Operating on a Common Set of Data. Part 3
L. J. LaPadula, David Elliott Bell · 1972
Abstract : 02AF-671AESDTR-147-Vol-3 See also Part 2, AD757903. A data-sharing scheduler is defined in terms of finite-state machine theory. Using the language and concepts of finite-state machines, the authors give precise definitions for the notions of delayed, blocked, deadlock, permanent blocking, and sharing a datum; these notions and their interrelationships lead to a characterization of a class of schedular (unrestricted and nontrivial); a basic theorem of data sharing is stated and proved, and its implications are explored. The authors also give a narrative summary and discussion of the main result of the work suitable for the system designer or analyst.