- From: Prasad Yendluri via cvs-syncmail <cvsmail@w3.org>
- Date: Thu, 14 Jun 2007 17:44:33 +0000
- To: public-ws-policy-eds@w3.org
Update of /sources/public/2006/ws/policy
In directory hutz:/tmp/cvs-serv26359
Modified Files:
ws-policy-framework.xml ws-policy-framework.html
Log Message:
Add hyeper-links to "policy" terms in the newly added text
Index: ws-policy-framework.xml
===================================================================
RCS file: /sources/public/2006/ws/policy/ws-policy-framework.xml,v
retrieving revision 1.146
retrieving revision 1.147
diff -u -d -r1.146 -r1.147
--- ws-policy-framework.xml 13 Jun 2007 19:25:43 -0000 1.146
+++ ws-policy-framework.xml 14 Jun 2007 17:44:30 -0000 1.147
@@ -1738,10 +1738,13 @@
As a first approximation, an intersection algorithm is defined below
that approximates compatibility of <termref def="policy_assertion">policy assertions</termref>
in a domain-independent manner. Mechanisms for determining
- assertion parameter compatibility are not part of this domain-independent
- policy intersection. Determining whether two policy assertions of the same
+ <termref def="policy_assertion_parameter">assertion parameter</termref>
+ compatibility are not part of this domain-independent
+ policy intersection. Determining whether two
+ <termref def="policy_assertion">policy assertions</termref> of the same
type are compatible may involve domain-specific processing for purposes of
- determining assertion parameter compatibility. Domain-independent policy
+ determining <termref def="policy_assertion_parameter">assertion parameter</termref>
+ compatibility. Domain-independent policy
intersection may be extended to include domain-specific processing.
If a domain-specific intersection processing algorithm is required this
will be known from the QName of the specific <termref def="policy_assertion_type">assertion type</termref>
@@ -1750,6 +1753,7 @@
QName indicates domain-specific processing, an implementation of the
domain-independent intersection need not apply the domain-specific processing.
</p>
+ <p>The domain-independent policy intersection algorithm is:</p>
<ulist>
<item>
<p>Two <termref def="policy_assertion">policy assertions</termref> are
@@ -1769,7 +1773,7 @@
are not part of the domain-independent compatibility
determination defined herein but this domain-independent policy intersection
may be extended to include domain-specific processing for purposes of
- determining assertion parameter compatibility.
+ determining <termref def="policy_assertion_parameter">Assertion parameter</termref> compatibility.
</p>
<ulist>
<item>
Index: ws-policy-framework.html
===================================================================
RCS file: /sources/public/2006/ws/policy/ws-policy-framework.html,v
retrieving revision 1.120
retrieving revision 1.121
diff -u -d -r1.120 -r1.121
--- ws-policy-framework.html 13 Jun 2007 19:25:43 -0000 1.120
+++ ws-policy-framework.html 14 Jun 2007 17:44:30 -0000 1.121
@@ -1104,10 +1104,13 @@
As a first approximation, an intersection algorithm is defined below
that approximates compatibility of <a title="policy assertion" href="#policy_assertion">policy assertions</a>
in a domain-independent manner. Mechanisms for determining
- assertion parameter compatibility are not part of this domain-independent
- policy intersection. Determining whether two policy assertions of the same
+ <a title="policy assertion parameter" href="#policy_assertion_parameter">assertion parameter</a>
+ compatibility are not part of this domain-independent
+ policy intersection. Determining whether two
+ <a title="policy assertion" href="#policy_assertion">policy assertions</a> of the same
type are compatible may involve domain-specific processing for purposes of
- determining assertion parameter compatibility. Domain-independent policy
+ determining <a title="policy assertion parameter" href="#policy_assertion_parameter">assertion parameter</a>
+ compatibility. Domain-independent policy
intersection may be extended to include domain-specific processing.
If a domain-specific intersection processing algorithm is required this
will be known from the QName of the specific <a title="policy assertion type" href="#policy_assertion_type">assertion type</a>
@@ -1115,7 +1118,7 @@
However, regardless of whether an assertion's
QName indicates domain-specific processing, an implementation of the
domain-independent intersection need not apply the domain-specific processing.
- </p><ul><li><p>Two <a title="policy assertion" href="#policy_assertion">policy assertions</a> are
+ </p><p>The domain-independent policy intersection algorithm is:</p><ul><li><p>Two <a title="policy assertion" href="#policy_assertion">policy assertions</a> are
compatible if they have the same <a title="policy assertion type" href="#policy_assertion_type">type</a> and</p></li><li><p>If either assertion contains a nested <a title="policy expression" href="#policy_expression">policy expression</a>, the two assertions are compatible if
they both have a nested policy expression and the alternative in the
nested policy expression of one is compatible with the alternative in
@@ -1124,7 +1127,7 @@
are not part of the domain-independent compatibility
determination defined herein but this domain-independent policy intersection
may be extended to include domain-specific processing for purposes of
- determining assertion parameter compatibility.
+ determining <a title="policy assertion parameter" href="#policy_assertion_parameter">Assertion parameter</a> compatibility.
</p><ul><li><p>If the mode is strict, two <a title="policy alternative" href="#policy_alternative">policy
alternatives</a> A and B are compatible: </p><ul><li><p>if each assertion in A is compatible with an assertion in B,
and</p></li><li><p>if each assertion in B is compatible with an assertion in
Received on Thursday, 14 June 2007 17:44:38 UTC