Show that the set S of security classes (A, C) is a
Chapter 8, Problem 8.6.48(choose chapter or problem)
Show that the set S of security classes (A, C) is a lattice, where A is a positive integer representing an authority class and C is a subset of a finite set of compartments, with (A1, C1) (A2, C2) ifand only if A1 ::'S A2 and C1 C2. [Hint: First show that (S, ) is a poset and then show that the least upper bound and greatest lower bound of (A1 , e1) and (A2, C2) are (max(A1 , A2), C1 U C2) and (min(A1 , A2), C1 n C2), respectively.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer