MLS concepts, relational question

[Michael C Thompson <thompsmc@us.ibm.com>]

OK, so assume there are two labels:
Label A -- s2:c1 - s15:c0.c1023
Label B -- s0:c1,c3,c5,...,c1021,c1023 (odd repeating)

What is the relationship between A and B?

As my understanding goes, and from a definition I found:

A dom B, iff:
level(A) >= level(B) and cat(A) <super set of> cat(B)

A domby B, iff:
level(A) <= level(B) and cat(A) <subset of> cat(B)

A eq B, iff:
level(A) == level(B) and cat(A) == cat(b)

A incomp B, iff:
cat(A) not <subset of> cat(B) AND
cat(B) not <subset of> cat(A)

Assuming all of those are accurate, label A does not DOM, DOMBY, or EQ 
B, yet they are not INCOMP...

Assuming all of the above is true, what do we call this relationship?

Thanks,
Mike


--
This message was distributed to subscribers of the selinux mailing list.
If you no longer wish to subscribe, send mail to majordomo@tycho.nsa.gov with
the words "unsubscribe selinux" without quotes as the message.