Abstract: A method and apparatus for defining and validating feature policies in an execution system, such as a communication system. The method includes entering user policies described in a straightforward manner (e.g. using a Web browser and user-understandable language) in such a way that they can be translated into a formal executable language. The user policies are then (translated into an executable feature language such as the IETE's CPL. The user is then either compelled or provided with an option to validate the overall feature set before the overall feature is uploaded to the execution system. If validation is selected, the features are translated from CPL into another format, such as FIAT, from which it is possible to detect common feature specification errors. That FIAT detected errors are then analyzed in a manner that is aware of the expectations and common errors of native users, and interpreted to determine possible errors as errors that are common to naïve users.

Abstract: A communication system for implementing personalizable and customizable features, comprising a tuple space, and a plurality of user agents representing the features, the user agents communicating with each other via assertions posted to the tuple space in order to implement the features while avoiding feature interactions, each of the features being structured as a set of deontic task trees having a parent node with an obliged inherent action and a plurality of child nodes with respective node actions performed according to a predetermined sequence, the results of which are reported back to the parent node, the parent node placing deontic modalities on the behavior of the child nodes such that successful implementation of the feature results from successful occurrence of the inherent action and composed success of the node actions of the children nodes.

Abstract: A method and apparatus are set forth for defining and validating feature policies in an execution system, such as a communication system. The method includes entering user policies described in a straightforward manner (e.g. using a Web browser and user-understandable language) in such a way that they can be translated into a formal executable language. The user policies are then translated into an executable feature language such as the IETF's CPL. The user is then either compelled or provided with an option to validate the overall feature set before it is uploaded to the execution system. If validation is selected, the features are translated from CPL into another format, such as FIAT, from which it is possible to detect common feature specification errors. The FIAT detected errors are then analyzed in a manner that is aware of the expectations and common errors of naive users, and interpreted to determine possible errors as errors that are common to naive users. These errors are reported to the user (e.g.

Abstract: According to the present invention, a plurality of new tuple-space operators is provided for enhancing the capability of tuple spaces to provide fine-grained control of presence and location systems. New Deactivate/Activate and Mass Timer Extension operators may be applied simultaneously to large numbers of tuples and anti-tuples, thereby improving system responsiveness. A new Query operator greatly increases the ability of presence and location systems to guarantee that private information in the tuple space remains private.

Abstract: A communication system for implementing personalizable and customizable features, comprising a tuple space, and a plurality of user agents representing the features, the user agents communicating with each other via assertions posted to the tuple space in order to implement the features while avoiding feature interactions, each of the features being structured as a set of deontic task trees having a parent node with an obliged inherent action and a plurality of child nodes with respective node actions performed according to a predetermined sequence, the results of which are reported back to the parent node, the parent node placing deontic modalities on the behavior of the child nodes such that successful implementation of the feature results from successful occurrence of the inherent action and composed success of the node actions of the children nodes.

Abstract: According to the present invention, a plurality of new tuple-space operators is provided for enhancing the capability of tuple spaces to provide fine-grained control of presence and location systems. New Deactivate/Activate and Mass Timer Extension operators may be applied simultaneously to large numbers of tuples and anti-tuples, thereby improving system responsiveness. A new Query operator greatly increases the ability of presence and location systems to guarantee that private information in the tuple space remains private.