US5303170A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for process modelling and project planning
Assignee: International Business Machines Corp
•
Filing: 1992-04-03
•
Granted: 1994-04-12
•
Expires: 2012-04-03
Abstract
Abstract Enables the flexible handling of time, iteration and resource type as variables. For example, project/process simulation tool defines an activity; defines alternative resources required to commence the activity; determine availability of the alternative resources; and varies a duration of the activity based on the availability of the alternative resources. According to another aspect, a modelling process is a computer, provided for including: supplying a modeling program having a plurality of predefined stages of execution which collectively define a transfer function of an activity within a network; defining a plurality of user supplied programming statements, each provided with a label indicative of at least one of the stages of execution; and, causing the modeling program, to execute the user supplied programming statements, each immediately followed by a stage of execution indicated by the associated label.
Inventors
- 👤 Andrew G. Valko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 06:31
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
123 words
A method for modelling on a computer a network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: selecting among N number of activities in the network as next activity or activities to be performed in the network as a successor activity or activities of the current activity, inputting for the current activity a plurality of conditions for starting or finishing M of N successor activity or activities in the network in which the N successor activity or activities are in relation to the current activity, and specifying each condition for starting or finishing a successor activity as a connection of the current activity to the successor activity.
Claim 2
Independent Claim
123 words
A method for modelling on a computer a network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: selecting among N number of activities in the network as next activity or activities to be performed in the network as a successor activity or activities of the current activity, inputting for the current activity a plurality of conditions for starting or finishing M of N successor activity or activities in the network in which the N successor activity or activities are in relation to the current activity, and specifying each condition for starting or finishing a successor activity as a connection of the current activity to the successor activity.
Claim 3
Dependent Claim
25 words
A computer modelling method as defined in claim 1, further comprising the step of: detecting each condition, and any condition(s) being a function of time.
Claim 4
Dependent Claim
26 words
A computer modelling method as defined in claim 1, further comprising the step of: detecting each condition, and any condition(s) not being a function of time.
Claim 5
Dependent Claim
29 words
The modelling method of claim 1, wherein the inputting step further comprises specifying a variable lag value between a the current end of the successor activities in the network.
Claim 6
Independent Claim
95 words
A method for modelling on a computer network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: selecting signal(s) from M out of N from predecessor activity or activities in the network as an input to the current activity, scanning the state of the M signal(s) to determine when the signals are in a predetermined state, and controlling a start or finish of the current activity by detecting when the state(s) of the M signal(s) are in the predetermined state(s).
Claim 7
Independent Claim
95 words
A method for modelling on a computer network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: selecting signal(s) from M out of N from predecessor activity or activities in the network as an input to the current activity, scanning the state of the M signal(s) to determine when the signals are in a predetermined state, and controlling a start or finish of the current activity by detecting when the state(s) of the M signal(s) are in the predetermined state(s).
Claim 8
Dependent Claim
40 words
A computer modelling method as defined in claim 5, further comprising the step of: detecting the signals as a function of process time to select which signal(s) are being used to control the start of finish of the current activity.
Claim 9
Independent Claim
145 words
A method for modelling on a computer a network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: first determining when a first set of M of N signal(s) from predecessor activity or activities to start the current activity are present in signal or activites from predecessor activity(s), after the first determining step, signalling successor activity or activities in relation to the start of the current activity, after the signalling step, waiting for a duration of the current activity, after the waiting step, second determining when a second set of signals from predecessor activity or activities to finish the current activity are present in signal(s) from predecessor activity or activities, and after the second determining step, signalling successor activity or activities in relation to the finish of the current activity.
Claim 10
Independent Claim
145 words
A method for modelling on a computer a network of activities, each activity being performed over a fixed or variable period of time within the method, each current activity comprising the steps of: first determining when a first set of M of N signal(s) from predecessor activity or activities to start the current activity are present in signal or activites from predecessor activity(s), after the first determining step, signalling successor activity or activities in relation to the start of the current activity, after the signalling step, waiting for a duration of the current activity, after the waiting step, second determining when a second set of signals from predecessor activity or activities to finish the current activity are present in signal(s) from predecessor activity or activities, and after the second determining step, signalling successor activity or activities in relation to the finish of the current activity.
Claim 11
Dependent Claim
75 words
The modelling method of claim 1, further comprising: inputting a plurality of user supplied programming statements before or after any step in claim 7, each of said programming statements being provided with a label indicative of at least one of a plurality of execution inputs in the process modeling tool; and, causing the process modelling tool to execute the user supplied programming statements, each immediately followed by an execution block indicated by the associated label.
References Cited (Backward Citations)
US4885686A
Cited
US5111404A
Cited
US4926362A
Cited
US5016170A
Cited
US5128860A
Cited
US5134560A
Cited
US5173869A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-11 | 1997-10-11 | 1998-04-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-11 | 2001-10-11 | 2002-04-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-11 | 2005-10-11 | 2006-04-12 | $7700.00 | Window Closed / Lapsed |