- From: Prasad Yendluri via cvs-syncmail <cvsmail@w3.org>
- Date: Tue, 29 May 2007 22:10:40 +0000
- To: public-ws-policy-eds@w3.org
Update of /sources/public/2006/ws/policy
In directory hutz:/tmp/cvs-serv15259
Modified Files:
ws-policy-framework.xml ws-policy-framework.html
Log Message:
Implemented the changes proposed at the Ottawa F2F for issue 4555. Editors' action 279.
Index: ws-policy-framework.xml
===================================================================
RCS file: /sources/public/2006/ws/policy/ws-policy-framework.xml,v
retrieving revision 1.138
retrieving revision 1.139
diff -u -d -r1.138 -r1.139
--- ws-policy-framework.xml 29 May 2007 22:02:45 -0000 1.138
+++ ws-policy-framework.xml 29 May 2007 22:10:38 -0000 1.139
@@ -1703,10 +1703,13 @@
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 function that takes two policies and returns a
- policy. There are two modes for intersection: strict and lax. How the mode is
- selected or indicated for the policy intersection is outside the scope of this
- specification. </p>
+ Policy Intersection is a commutative operation performed on two policies that
+ yields a policy that contains a collection of the compatible policy alternatives.
+ (Note: while policy intersection at times is analogous with set intersection,
+ it does not imply formal set intersection semantics). There are two modes for
+ intersection: strict and lax. How the mode is selected or indicated for the policy
+ intersection is outside the scope of this specification.
+ </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
@@ -3212,6 +3215,14 @@
Editors' action <loc href="http://www.w3.org/2005/06/tracker/wspolicyeds/actions/278">278</loc>.
</td>
</tr>
+ <tr>
+ <td>20070529</td>
+ <td>PY</td>
+ <td>Implemented the changes proposed at the Ottawa F2F
+ for issue <loc href="http://www.w3.org/Bugs/Public/show_bug.cgi?id=4555">4555</loc>.
+ Editors' action <loc href="http://www.w3.org/2005/06/tracker/wspolicyeds/actions/279">279</loc>.
+ </td>
+ </tr>
</tbody>
</table>
</inform-div1>
Index: ws-policy-framework.html
===================================================================
RCS file: /sources/public/2006/ws/policy/ws-policy-framework.html,v
retrieving revision 1.113
retrieving revision 1.114
diff -u -d -r1.113 -r1.114
--- ws-policy-framework.html 29 May 2007 22:02:45 -0000 1.113
+++ ws-policy-framework.html 29 May 2007 22:10:38 -0000 1.114
@@ -1075,10 +1075,13 @@
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 function that takes two policies and returns a
- policy. There are two modes for intersection: strict and lax. How the mode is
- selected or indicated for the policy intersection is outside the scope of this
- specification. </p><p>Because the set of behaviors indicated by a <a title="policy alternative" href="#policy_alternative">policy alternative</a> depends on the domain-specific semantics of
+ Policy Intersection is a commutative operation performed on two policies that
+ yields a policy that contains a collection of the compatible policy alternatives.
+ (Note: while policy intersection at times is analogous with set intersection,
+ it does not imply formal set intersection semantics). There are two modes for
+ intersection: strict and lax. How the mode is selected or indicated for the policy
+ intersection is outside the scope of this specification.
+ </p><p>Because the set of behaviors indicated by a <a title="policy alternative" href="#policy_alternative">policy alternative</a> 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 this will be known from the QNames
@@ -1521,4 +1524,7 @@
</td></tr><tr><td rowspan="1" colspan="1">20070529</td><td rowspan="1" colspan="1">PY</td><td rowspan="1" colspan="1">Implemented the changes proposed at the Ottawa F2F
for issue <a href="http://www.w3.org/Bugs/Public/show_bug.cgi?id=4553">4553</a>.
Editors' action <a href="http://www.w3.org/2005/06/tracker/wspolicyeds/actions/278">278</a>.
+ </td></tr><tr><td rowspan="1" colspan="1">20070529</td><td rowspan="1" colspan="1">PY</td><td rowspan="1" colspan="1">Implemented the changes proposed at the Ottawa F2F
+ for issue <a href="http://www.w3.org/Bugs/Public/show_bug.cgi?id=4555">4555</a>.
+ Editors' action <a href="http://www.w3.org/2005/06/tracker/wspolicyeds/actions/279">279</a>.
</td></tr></tbody></table><br></div></div></body></html>
\ No newline at end of file
Received on Tuesday, 29 May 2007 22:10:43 UTC