2006/ws/policy ws-policy-framework.xml,1.49,1.50

Update of /sources/public/2006/ws/policy
In directory hutz:/tmp/cvs-serv778

Modified Files:
	ws-policy-framework.xml 
Log Message:
Completed action item: 29 (http://www.w3.org/2005/06/tracker/wspolicyeds/actions/29) for issue 3577, Semantics of successful intersection determined by domain-specific assertion content. 

Index: ws-policy-framework.xml
===================================================================
RCS file: /sources/public/2006/ws/policy/ws-policy-framework.xml,v
retrieving revision 1.49
retrieving revision 1.50
diff -u -d -r1.49 -r1.50
--- ws-policy-framework.xml	20 Sep 2006 22:27:16 -0000	1.49
+++ ws-policy-framework.xml	21 Sep 2006 18:28:04 -0000	1.50
@@ -1199,7 +1199,16 @@
 <div2 id="Policy_Intersection">
 <head>Policy Intersection</head>
 <p>Policy intersection is useful when two or more parties express <termref def='policy'>policy</termref> and want to limit the <termref def='policy_alternative'>policy alternatives</termref> to those that are mutually compatible. For example, when a requester and a provider express requirements on a message exchange, intersection identifies compatible policy alternatives (if any) included in both requester and provider policies. Intersection is a commutative, associative function that takes two policies and returns a policy.</p>
-<p>Because the set of behaviors indicated by a <termref def='policy_alternative'>policy alternative</termref> depends on the domain-specific semantics of the collected assertions, determining whether two policy alternatives are compatible generally involves domain-specific processing. As a first approximation, an algorithm is defined herein that approximates compatibility in a domain-independent manner; specifically, for two policy alternatives to be compatible, they must at least have the same vocabulary (see Section <specref ref="rPolicy_Alternative"/>).</p>
+<p>Because the set of behaviors indicated by a <termref def='policy_alternative'>policy 
+alternative</termref> depends on the domain-specific semantics of the collected assertions, 
+determining whether two policy alternatives are compatible generally involves 
+domain-specific processing. If a domain-specific intersection processing algorithm 
+is required will be known from the QNames of the specific <termref def='policy_assertion_type'>assertion types</termref>
+involved in the policy alternatives. As a first approximation, an algorithm is defined herein 
+that approximates compatibility in a domain-independent manner; specifically, 
+for two policy alternatives to be compatible, they must at least have the same 
+vocabulary (see Section <specref ref="rPolicy_Alternative"/>).
+</p>
 <ulist>
 <item><p>Two <termref def='policy_assertion'>policy assertions</termref> are compatible if they have the same <termref def='policy_assertion_type'>type</termref> and</p></item>
 <item><p>If either assertion contains a nested <termref def='policy_expression'>policy expression</termref>, 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 the nested policy expression of the other.</p></item>
@@ -1816,6 +1825,16 @@
                            Add PolicyReference extensibility.
                         </td>
                     </tr>
+                    <tr>
+                        <td>20060921</td>
+                        <td>PY</td>
+                        <td>Completed action item:
+                            <loc href="http://www.w3.org/2005/06/tracker/wspolicyeds/actions/29">29</loc>
+                            for issue 
+                            <loc href="http://www.w3.org/Bugs/Public/show_bug.cgi?id=3577">3577</loc>,
+                            Semantics of successful intersection determined by domain-specific assertion content.
+                        </td>
+                    </tr>
                 </tbody>
             </table>
         </inform-div1>

Received on Thursday, 21 September 2006 18:28:15 UTC