Outline for January 11, 2001
- Greetings and felicitations!
- First part of project due Friday
- Web page up and running!
- Process models
- Theorem: If a system is mutually noninterfering, it is determinate.
- Theorem: Let fp be an interpretation of process
p. Let PI be a system of processes, with p in PI.
If for all such p, domain(p) <> Ø and
range(p) <> Ø, but fp unspecified, is
determinate for all fp, then all processes in PI are
- Maximally parallel system: determinate system for which the removal
of any pair from the relation ->
makes the two processes in the pair interfering processes.
- Critical section problem
- Mutual exclusion
- Bounded wait
- Classical problems
- Readers/writers (first: readers priority; second: writers priority)
- Dining philosophers
- Basic language constructs
- Evaluating higher-level language constructs
- Expressive power
- Ease of use
- Relationship with proram structure
- Process failures, unanticipated faults (exception handling)
- Real-time systems
- Higher-level language constructs
- Crowd monitors
- Invariant expressions
The handout "Mutual Non-Interference and Determinism"
does not translate into HTML because of the notations. Please download
the PDF or Postscript version from the class home page.
Office: 3059 Engineering Unit II
Phone: +1 (530) 752-8060
Fax: +1 (530) 752-4767
Copyright Matt Bishop, 2001.
All federal and state copyrights reserved for all original material
presented in this course through any medium, including lecture or print.
Page last modified on 1/10/2000