Patent US5437007A successfully refreshed from Google Patents.
US5437007A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Control sequencer in an iconic programming system
Assignee: Agilent Technologies Inc
•
Filing: 1992-11-10
•
Granted: 1995-07-25
•
Expires: 2012-11-10
Abstract
Abstract An iconic programming system that provides a sequencer icon to allow a series of operations to be performed, along with the conditions under which the operations are performed. Each operation performed, called a transaction, can be enabled or disabled, or can be enabled by a function within the process. The results of each transaction can be compared to tolerance limits and alternate subsequent transactions processed based upon whether the transaction results fell within the tolerance limits. The output of each transaction can be logged into a buffer to keep the results for later analysis.
Inventors
- 👤 Randy L. Bailey
- 👤 Douglas C. Beethe
- 👤 James P. Armentrout
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 15:15
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/30; G06F8/34; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/97
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
216 words
In an iconic programming system process executing in a computer system, a computer executed method for performing a list of transactions within one icon of said iconic programming system process, said computer executed method comprising the steps of: (a) displaying a sequencer icon having said list of transactions wherein each transaction in said list identifies a tolerance limit, a test expression, a pass transaction identifier of a transaction contained within said list, and a fail transaction identifier of a transaction contained within said list, wherein said test expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction; (b) assigning a top transaction of said list as a current transaction; (c) performing a test expression of said current transaction; (d) comparing a result of said test expression of said current transaction to said tolerance limit identified in said current transaction; (e) when said result is within said tolerance limit, assigning a transaction identified by said pass transaction identifier to said current transaction; and (f) when said result is outside said tolerance limit, assigning a transaction identified by said fail transaction identifier to said current transaction; and (g) repeating steps (c) through (f) until said list is exhausted.
Claim 2
Dependent Claim
216 words
In an iconic programming system process executing in a computer system, a computer executed method for performing a list of transactions within one icon of said iconic programming system process, said computer executed method comprising the steps of: (a) displaying a sequencer icon having said list of transactions wherein each transaction in said list identifies a tolerance limit, a test expression, a pass transaction identifier of a transaction contained within said list, and a fail transaction identifier of a transaction contained within said list, wherein said test expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction; (b) assigning a top transaction of said list as a current transaction; (c) performing a test expression of said current transaction; (d) comparing a result of said test expression of said current transaction to said tolerance limit identified in said current transaction; (e) when said result is within said tolerance limit, assigning a transaction identified by said pass transaction identifier to said current transaction; and (f) when said result is outside said tolerance limit, assigning a transaction identified by said fail transaction identifier to said current transaction; and (g) repeating steps (c) through (f) until said list is exhausted.
Claim 3
Dependent Claim
48 words
The process of claim 1 wherein each transaction in said list further comprises a logging flag, and wherein step (c) further comprises the steps of: (c1) when said logging flag defines that logging is requested, after performing said test expression, storing said result in a logging data area.
Claim 4
Dependent Claim
25 words
The process of claim 2 wherein said storing comprises the step of calling a function within said iconic programming system process to perform said storing.
Claim 5
Dependent Claim
53 words
The process of claim 1 wherein each transaction in said list further comprises an enable condition, and wherein step (c) further comprises the step of: (c2) when said enable condition is not met, assigning a next transaction following said current transaction in said list as said current transaction before performing said test expression.
Claim 6
Dependent Claim
72 words
The process of claim 4 wherein step (c2) further comprises the step of: (c2a) evaluating an expression within said iconic programming system process, and defining said enable condition as met when said expression evaluation results in a value of true, wherein said expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction.
Claim 7
Dependent Claim
52 words
The process of claim 1 wherein each transaction in said list further comprises a disable condition, and wherein step (c) further comprises the step of: (c2) when said disable condition is met, assigning a next transaction following said current transaction in said list as said current transaction before performing said test expression.
Claim 8
Dependent Claim
72 words
The process of claim 6 wherein step (c2) further comprises the step of: (c2a) evaluating an expression within said iconic programming system process, and defining said disable condition as met when said expression evaluation results in a value of true, wherein said expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction.
Claim 9
Dependent Claim
78 words
The process of claim 1 wherein each transaction in said list further comprises a repeat count for said fail transaction identifier, and wherein step (f) further comprises the step of: (f2)incrementing a fail count; (f3) when said fail count is less than or equal to said repeat count, repeating steps (c) through (f); and (f4) when said fail count is greater than said repeat count, assigning a transaction identified by said fail transaction identifier to said current transaction.
Claim 10
Dependent Claim
38 words
The process of claim 1 wherein step (e) further comprises the step of: (e1) when said pass transaction identifier contains no transaction identifier, assigning a next transaction following said current transaction in said list as said current transaction.
Claim 11
Dependent Claim
38 words
The process of claim 1 wherein step (f) further comprises the step of: (f1) when said fail transaction identifier contains no transaction identifier, assigning a next transaction following said current transaction in said list as said current transaction.
Claim 12
Dependent Claim
244 words
In an iconic programming system process executing in a computer system, a computer executed method for performing a list of transactions within one icon of said iconic programming system process, said computer executed method comprising the steps of: (a) displaying a sequencer icon having said list of transactions wherein each transaction in said list comprises an enable condition, a test expression, a tolerance limit, a pass transaction identifier that identifies a transaction contained within said list, and a fail transaction identifier that identifies a transaction contained within said list, wherein said test expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction; (b) assigning a top transaction of said list as a current transaction; (c) when said enable condition is not met, assigning a next transaction following said current transaction in said list as said current transaction and repeating step (c). (d) performing a test expression of said current transaction; (e) comparing a result of said test expression to said tolerance limit identified for said current transaction; (f) when said result is within said tolerance limit, assigning a transaction identified by said pass transaction identifier to said current transaction; and (g) when said result is outside said tolerance limit, assigning a transaction identified by said fail transaction identifier to said current transaction; and (h) repeating steps (c) through (g) until said list is exhausted.
Claim 13
Dependent Claim
244 words
In an iconic programming system process executing in a computer system, a computer executed method for performing a list of transactions within one icon of said iconic programming system process, said computer executed method comprising the steps of: (a) displaying a sequencer icon having said list of transactions wherein each transaction in said list comprises an enable condition, a test expression, a tolerance limit, a pass transaction identifier that identifies a transaction contained within said list, and a fail transaction identifier that identifies a transaction contained within said list, wherein said test expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction; (b) assigning a top transaction of said list as a current transaction; (c) when said enable condition is not met, assigning a next transaction following said current transaction in said list as said current transaction and repeating step (c). (d) performing a test expression of said current transaction; (e) comparing a result of said test expression to said tolerance limit identified for said current transaction; (f) when said result is within said tolerance limit, assigning a transaction identified by said pass transaction identifier to said current transaction; and (g) when said result is outside said tolerance limit, assigning a transaction identified by said fail transaction identifier to said current transaction; and (h) repeating steps (c) through (g) until said list is exhausted.
Claim 14
Dependent Claim
48 words
The process of claim 11 wherein each transaction in said list further comprises a logging flag, and wherein step (d) further comprises the steps of: (d1) when said logging flag defines that logging is requested, after performing said test expression, storing said result in a logging data area.
Claim 15
Dependent Claim
25 words
The process of claim 12 wherein said storing comprises the step of calling a function within said iconic programming system process to perform said storing.
Claim 16
Dependent Claim
72 words
The process of claim 11 wherein step (c) further comprises the step of: (c1) evaluating an expression within said iconic programming system process, and defining said enable condition as met when said expression evaluation results in a value of true, wherein said expression is either a call to an iconic procedure, a call to a conventional programming process, a mathematical equation, or a variable containing data logged by a previously performed transaction.
Claim 17
Dependent Claim
79 words
The process of claim 11 wherein each transaction in said list further comprises a repeat count for said fail transaction identifier, and wherein step (g) further comprises the step of: (g2) incrementing a fail count; (g3) when said fail count is less than or equal to said repeat count, repeating steps (c) through (f); and (g4) when said fail count is greater than said repeat count, assigning a transaction identified by said fail transaction identifier to said current transaction.
Claim 18
Dependent Claim
38 words
The process of claim 11 wherein step (f) further comprises the step of: (f1) when said pass transaction identifier contains no transaction identifier, assigning a next transaction following said current transaction in said list as said current transaction.
Claim 19
Dependent Claim
38 words
The process of claim 11 wherein step (g) further comprises the step of: (g1) when said fail transaction identifier contains no transaction identifier, assigning a next transaction following said current transaction in said list as said current transaction.
References Cited (Backward Citations)
US5291587A
Cited
US4901221A
Cited
US4914568A
Cited
WO1991006050A1
Cited
US5208743A
Cited
US5253158A
Cited
US5313575A
Cited
US5313574A
Cited
US5301301A
Cited
US5377318A
Cited
US5293476A
Cited
US5261043A
Cited
US5251159A
Cited
EP0508632A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-07-24 | 1999-01-23 | 1999-07-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-07-24 | 2003-01-23 | 2003-07-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-07-24 | 2007-01-23 | 2007-07-25 | $7700.00 | Window Closed / Lapsed |