# US 2001/0056437 A1 · Method and apparatus for process design

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2001/0056437 A1
- Document ID: US20010056437A1
- Status: Published application
- Kind: A1
- Application number: 09/891,485
- Filed: 2001-06-25
- Published: 2001-12-27
- Earliest claimed: 2000-06-27
- Assignees: METAPOWER, LLC, An Oregon Limited Liability Company
- Inventors: Kenneth R. Allen; John Prouty; David E. Wheeler
- Web page: https://patentgrep.com/patent/US20010056437A1

## CPC

- G06Q 10/10: Office automation; Time management
- G06F 8/24: {Object-oriented}
- Y10S 707/99931: Database or file accessing
- Y10S 707/99954: Version management
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A process is managed by creating a future revision of a base. Data are input into the future revision of the base. The future revision of the base is made current, revising the base. A control tracks the authorization of the base revision, storing the authorization of the future revision of the base.

## Claims

### Claim 1

An apparatus for managing process design in a computer, the apparatus comprising:
a computer, including a memory;
a base stored in the memory, the base including information about an object in the process design; and
a control stored in the memory, including information about a process in the process design, the control operable on the base.

### Claim 2 (depends on 1)

An apparatus according to claim 1, wherein the base includes a revision of the base, the revision indicating a change in the information about the object in the base.

### Claim 3 (depends on 1)

An apparatus according to claim 1, wherein the control includes a revision of the control, the revision indicating a change in the information about the process in the control.

### Claim 4 (depends on 1)

An apparatus according to claim 1, further comprising:
a second base including information about a second object in the process design;
an intersection stored in the memory, designed to correlate the information in the base with the information in the second base; and
a second control stored in the memory, including information about a process in the process design, the control operable on the intersection.

### Claim 5 (depends on 4)

An apparatus according to claim 4, wherein the intersection includes a revision of the intersection, the revision indicating a change in the correlation of the information in the base with the information in the second base.

### Claim 6 (depends on 1)

An apparatus according to claim 1, further comprising:
a second base including information about a second object in the process design;
a transaction stored in the memory, designed to transfer a resource from the base to the second base; and
a second control stored in the memory, including information about a process in the process design, the control operable on the transaction.

### Claim 7 (depends on 1)

An apparatus according to claim 1, further comprising:
a second base including information about a second object in the process design;
an observation stored in the memory, designed to observe the base from the perspective of the second instance of the base; and
a second control stored in the memory, including information about a process in the process design, the control operable on the observation.

### Claim 8 (depends on 1)

An apparatus according to claim 1, wherein the base can only be revised using the control.

### Claim 9 (depends on 1)

An apparatus according to claim 1, wherein:
the information in the control includes a field for a value, without which the control cannot operate; and
the apparatus further comprises a second control stored in the memory, including information about a process in the process design, the second control operable on the control to supply the value for the field.

### Claim 10 (depends on 9)

An apparatus according to claim 9, wherein the control is designed so that it cannot provide the value for the field.

### Claim 11 (depends on 1)

An apparatus according to claim 1, wherein the base includes a future revision of the base, the future revision indicating a future change in the information about the object in the process design.

### Claim 12 (depends on 11)

An apparatus according to claim 11, wherein the base further includes a second future revision of the base, the second future revision including a second future change in the information about the object in the process design.

### Claim 13 (depends on 12)

An apparatus according to claim 12, wherein:
the future revision of the base includes a third future change in the information about the object in the process design;
the second future revision of the instance of the base includes a fourth future change in the information about the object in the process design; and
the third future change in the future revision and the fourth future change in the second future revision are the same change.

### Claim 14 (depends on 1)

An apparatus according to claim 1, wherein the base includes an ID of the control.

### Claim 15

A computer-implemented method for managing process design, the method comprising:
creating a future revision of a base;
inputting data into the future revision; and
making the future revision current.

### Claim 16 (depends on 15)

A method according to claim 15, wherein making the future revision current includes retaining a prior revision of the base.

### Claim 17 (depends on 16)

A method according to claim 16, wherein retaining a prior revision of the base includes changing a current revision to a historic revision.

### Claim 18 (depends on 15)

A method according to claim 15, wherein inputting data includes inputting data relating to a changing field of the base into the future revision.

### Claim 19 (depends on 15)

A method according to claim 15, further comprising validating the future revision.

### Claim 20 (depends on 19)

A method according to claim 19, wherein validating the future revision includes checking that a necessary field has data.

### Claim 21 (depends on 19)

A method according to claim 19, wherein validating the future revision includes making sure that a field in the future includes valid data.

### Claim 22 (depends on 15)

A method according to claim 15, further comprising linking the future revision with a control.

### Claim 23 (depends on 15)

A method according to claim 15, further comprising inputting data to a control of the base.

### Claim 24

A computer-implemented method for correlating information between a first base and a second base, the method comprising:
creating a future revision of an intersection;
inputting data into the intersection, thereby correlating the first base and the second base; and
making the future revision current.

### Claim 25 (depends on 24)

A method according to claim 24, further comprising retaining a prior revision of the intersection.

### Claim 26 (depends on 25)

A method according to claim 25, wherein retaining a prior revision of the intersection includes changing a current revision to a historic revision.

### Claim 27 (depends on 24)

A method according to claim 24, further comprising linking the future revision with a control.

### Claim 28 (depends on 24)

A method according to claim 24, further comprising inputting data to a control of the intersection.

### Claim 29

A computer-implemented method for observing information about a first base from a second base, the method comprising:
creating an observation;
taking a measurement of information in the first base, from information in the second base; and
storing the measurement in the observation.

### Claim 30 (depends on 29)

A method according to claim 29, wherein taking a measurement includes determining the accuracy of the observation.

### Claim 31 (depends on 29)

A method according to claim 29, wherein taking a measurement includes assigning a tolerance to the observation.

### Claim 32 (depends on 29)

A method according to claim 29, wherein taking a measurement includes observing a condition surrounding the measurement.

### Claim 33 (depends on 29)

A method according to claim 29, wherein storing the measurement includes keeping a prior measurement in the observation.

### Claim 34

A computer-implemented method for performing a transaction between a first base and a second base, the method comprising:
identifying a resource in the first base;
move the resource from the first base to the second base; and
paying the first base for the resource by the second base.

### Claim 35

A computer-implemented method for generating a control, the method comprising:
evaluating a criterion using a generator;
generating starting data from the criterion;
producing a control using a template and the starting data; and
invoking the control.

### Claim 36 (depends on 35)

A method according to claim 35, wherein evaluating a criterion includes evaluating a criterion from an observation using a generator.

### Claim 37 (depends on 35)

A method according to claim 35, wherein evaluating a criterion includes evaluating a criterion from a transaction using a generator.

### Claim 38

A computer-implemented method for correlating information between a first control and a second control, the method comprising:
creating an intersection;
inputting data to a control of the intersection; and
inserting at least some of the data into the intersection, thereby correlating the first control and the second control.
