← Back to Patent Explorer
US5150367A Expired / Lapsed US ⏱️ 0.0 years remaining

Composite range constraint propagation control

Assignee: Lockheed Martin Corp
•
Filing: 1990-03-02
•
Granted: 1992-09-22
•
Expires: 2010-03-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for constraint propagation control including determining whether more than one range is to be propagated through a selected component, propagating the one range if only one range is to be propagated, and propagated a composite range if more than one range is to be propagated and if the ranges are sufficiently identical.

Inventors

  • 👤 David W. Tong
  • 👤 Kevin C. Zalondek
  • 👤 Christopher H. Jolly

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 23:08
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/22; G06F11/2257

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 121 words
A method for composite range constraint propagation control, a constraint propagation mechanism being utilized to implement propagation, said method comprising the steps of: determining whether more than one range is to be propagated through a selected component; propagating one range if only one range is to be propagated; and propagating a composite range if more than one range is to be propagated, and if the ranges are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.
Claim 2
Independent Claim 121 words
A method for composite range constraint propagation control, a constraint propagation mechanism being utilized to implement propagation, said method comprising the steps of: determining whether more than one range is to be propagated through a selected component; propagating one range if only one range is to be propagated; and propagating a composite range if more than one range is to be propagated, and if the ranges are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.
Claim 3
Dependent Claim 30 words
A method for composite range constraint propagation in accordance with claim 1 wherein the predetermined threshold comprises a value obtained as a function of one or more of the ranges.
Claim 4
Dependent Claim 136 words
A computer implemented method for constraint propagation control, a constraint propagation mechanism being utilized to implement propagation through a connectivity and functional model of system components, for each component selected for propagation, said method comprising the steps of: determining whether more than one range is to be propagated through a selected component; propagating one range if only one range is to be propagated; and propagating a composite range if more than one range, is to be propagated, and if the ranges are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.
Claim 5
Dependent Claim 136 words
A computer implemented method for constraint propagation control, a constraint propagation mechanism being utilized to implement propagation through a connectivity and functional model of system components, for each component selected for propagation, said method comprising the steps of: determining whether more than one range is to be propagated through a selected component; propagating one range if only one range is to be propagated; and propagating a composite range if more than one range, is to be propagated, and if the ranges are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.
Claim 6
Dependent Claim 28 words
A method for constraint propagation in accordance with claim 3, wherein the predetermined threshold comprises a value obtained as a function of one or more of the ranges.
Claim 7
Independent Claim 92 words
An apparatus for constraint propagation comprising: means for propagating ranges of values through a component represented as a transfer function in a model; means for propagating a composite range through the component if the ranges of values are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.
Claim 8
Independent Claim 92 words
An apparatus for constraint propagation comprising: means for propagating ranges of values through a component represented as a transfer function in a model; means for propagating a composite range through the component if the ranges of values are sufficiently identical, said sufficiency of identity being determined by comparing a predetermined threshold to the sum of the absolute values of a first and second value, wherein said first value is the difference between the maximum values of said ranges and said second value is the difference between the minimum values of said ranges.

References Cited (Backward Citations)

US5012430A Cited
US4875184A Cited
US4766595A Cited
US4972415A Cited
US4862399A Cited
US4965758A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-09-22 1996-03-23 1996-09-22 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-09-22 2000-03-23 2000-09-22 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-09-22 2004-03-23 2004-09-22 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag