-
公开(公告)号:US07373343B2
公开(公告)日:2008-05-13
申请号:US11104159
申请日:2005-04-12
申请人: Laurent L. Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
发明人: Laurent L. Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
IPC分类号: G06F7/06
CPC分类号: G06Q10/10 , Y10S707/99934
摘要: Described is a method and system of requirements management including the expression in a requirements management tool of a relationship selected from the group consisting of a satisfaction relationship, an alternative relationship, a conflict relationship, and a constant dependency relationship.Described is a requirements management method including a first automatic analyzing of a requirements set to find conflicts, having a conflict free requirements subset. and a second automatic analyzing of the requirements set to verify completeness.
摘要翻译: 描述了需求管理的方法和系统,包括在从满足关系,替代关系,冲突关系和常数依赖关系组成的组中选择的关系的需求管理工具中的表达。 描述了一种需求管理方法,其包括对发现冲突的要求集的第一自动分析,具有无冲突的需求子集。 并对要求进行第二次自动分析以验证完整性。
-
公开(公告)号:US20090144065A1
公开(公告)日:2009-06-04
申请号:US11926146
申请日:2007-12-04
申请人: Laurent L. Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
发明人: Laurent L. Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
IPC分类号: G06Q10/00
CPC分类号: G06Q10/06
摘要: Described is a method and system of requirements management including the expression in a requirements management tool of a relationship selected from the group consisting of a satisfaction relationship, an alternative relationship, a conflict relationship, and a content dependency relationship.Described is a requirements management method including a first automatic analyzing of a requirements set to find conflicts, having a conflict free requirements subset and a second automatic analyzing of the requirements set to verify completeness.
摘要翻译: 描述了需求管理的方法和系统,其包括在从满足关系,替代关系,冲突关系和内容依赖关系组成的组中选择的关系的需求管理工具中的表达。 描述了一种需求管理方法,其包括对发现冲突的要求集的第一自动分析,具有无冲突需求子集以及要求集合的第二自动分析以验证完整性。
-
公开(公告)号:US20060230034A1
公开(公告)日:2006-10-12
申请号:US11104159
申请日:2005-04-12
申请人: Laurent Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
发明人: Laurent Balmelli , Fausto Bernardini , Olga Golovenevsky , Jose Gomes , Mila Keren , Abraham Zehavi
IPC分类号: G06F17/30
CPC分类号: G06Q10/10 , Y10S707/99934
摘要: Described is a method and system of requirements management including the expression in a requirements management tool of a relationship selected from the group consisting of a satisfaction relationship, an alternative relationship, a conflict relationship, and a constant dependency relationship. Described is a requirements management method including a first automatic analyzing of a requirements set to find conflicts, having a conflict free requirements subset. and a second automatic analyzing of the requirements set to verify completeness.
摘要翻译: 描述了需求管理的方法和系统,包括在从满足关系,替代关系,冲突关系和常数依赖关系组成的组中选择的关系的需求管理工具中的表达。 描述了一种需求管理方法,其包括对发现冲突的要求集的第一自动分析,具有无冲突的需求子集。 并对要求进行第二次自动分析以验证完整性。
-
4.
公开(公告)号:US07337230B2
公开(公告)日:2008-02-26
申请号:US10213808
申请日:2002-08-06
申请人: Abraham Zehavi
发明人: Abraham Zehavi
IPC分类号: G06F15/16 , G06F15/173
CPC分类号: G06F17/10
摘要: A computer implemented method and system determines whether a rule R is redundant with respect to a rule set S containing a plurality of non-redundant rules each defining tests for performing on a corresponding numeric field. A new rule set S′ is generated containing for each rule Ri in S its intersection with R (Ri) where R and Ri intersect; and respective numbers of packets that satisfy R and the union of all rules in S′ are calculated. If these numbers are equal the rule R is redundant with respect to the rule set S. Any arbitrary set of rules may be processed using such an approach so as to generate a new rule set that contains no redundant rules by determining whether each rule is redundant with respect to an initially empty rule set S1 and adding only those rules that are not redundant to the rule set S1.
摘要翻译: 计算机实现的方法和系统确定规则R是否相对于包含多个非冗余规则的规则集S是冗余的,每个规则集定义了在相应的数字字段上执行的测试。 生成新的规则集S',其中包含S中与R(R i)的交集中的每个规则R i i i,其中R和R i, 相交; 并计算满足R的分组数和S'中所有规则的并集。 如果这些数字相等,则规则R相对于规则集S S是冗余的。可以使用这种方法来处理任意任意的规则集合,以便通过确定每个规则是否是冗余来生成不包含冗余规则的新规则集 相对于初始为空的规则集S1,并且仅添加规则集S 1中不冗余的那些规则。
-
-
-