Outline for April 10, 2003

1. Take-Grant
   1. can·share(r, x, y, G₀) iff there is an edge from x to y labelled r in G₀, or all of the following hold:
      1. there is a vertex y′ with an edge from y′ to y labelled r;
      2. there is a subject y′′ which terminally spans to y′, or y′′ = y′;
      3. there is a subject x′ which initially spans to x, or x′ = x; and
      4. there is a sequence of islands I₁, ..., I_n connected by bridges for which x′ is in I₁ and y′ is in I_n.
   2. Go through interpretation
   3. can·steal(r, x, y, G₀) iff all of the following hold:
      1. there is no edge in G₀ from x to y labelled r;
      2. there is a subject x′ which initially spans to x, or x′ = x; and
      3. there is a vertex y′ with an edge labeled r to y in G₀ for which can·share(t, x, y′, G₀) holds
   4. Present conspiracies
2. Schematic Protection Model
   1. Model components
   2. Link function
   3. Filter function
   4. Example: Take-Grant as an instance of SPM
   5. Create operations and attenuation