Method for rapid development of software systems

• US 5,542,070 A
• Filed: 12/19/1994
• Issued: 07/30/1996
• Est. Priority Date: 05/20/1993
• Status: Expired due to Fees

• Current Assignee: AG Communication Systems Corp. (Nokia Corporation)
• Original Assignee: AG Communication Systems Corp. (Nokia Corporation)
• Inventors: LeBlanc, Rene, Perry, Thomas J.
• Primary Examiner(s): Lim, Krisna
• Assistant Examiner(s): Maung, Zarni
• Application Number:
  US08/358,651
• Time in Patent Office: 589 Days
• Field of Search: 395/500, 395/650, 395/700, 395/375
• US Class Current: 703/20
• CPC Class Codes: G06F 11/3608 using formal methods, e.g. model checking, abstract interpretation theorem proving G06N5/013
• CPC Class Codes: G06F 30/3323 using formal methods, e.g. equivalence checking or property checking

Abstract

Two major Forth extensions provide high-level support for building rapid prototypes for systems. These extensions form distinct language vocabularies available in the Forth environment. One is a Finite State Machine Language, named FSML, and the other is an object oriented language, named 200L. Using these extension and the inherent expandability of the Forth language, a prototype can be rapidly created. The modeling method requires four steps. First, using 200L, the system is described as a set of objects. At least one of the objects must be a controlling object and so identified. Second, using FSML, the controlling object is described as a finite state machine. Third, the system'"'"'s operation is expressed as a collection of one or more finite state machines. Each finite state machine type is defined with a unique machine type name. Any number of instances of a finite state machine type can be dynamically created at execution time. Fourth, communication is allowed between the finite state machines.

Claims

1. A method for a user to design a computer system to simulate an external system, said method comprising the steps of:

using the Forth collection of programming environment building blocks to create a finite state machine language and an object oriented language;

using said Forth collection of programming building blocks, said finite state machine language and said object oriented language to define said external system as a plurality of objects, said plurality of objects consisting of at least one controlling object;

said objects comprising a plurality of data where said plurality of data describes said object; and

a plurality of operations that can be performed by said computer system on said plurality of data;

defining said at least one controlling object as a finite state machine;

defining said system as a plurality of finite state machines;

defining communication protocols between said plurality of finite state machines;

determining a closest match between said object and a previously defined object;

selecting said closest match and creating a new object based on said closest match;

defining said plurality of data for said object; and

defining said plurality of operations for said object.

2. A method as claimed in claim 1 wherein each of said steps of defining said controlling object and said system as finite state machines comprises the steps of:

defining a plurality of states that said finite state machine can assume;

defining a next state transition pair, for each of said plurality of states said next state transition pair describes a next state for said finite state machine;

defining an action routine for each of said next state transition pair, said action routine describes what action said computer should take when said finite state machine transitions to said next state.

3. A method as claimed in claim 2 wherein each of said steps of defining said controlling object and said system as finite state machines further comprises the steps of:

for each of said plurality of states, defining only valid inputs;

defining said next state for each of said valid inputs; and

defining said action routine for each of said valid inputs.

4. A method for designing a computer system to simulate an external system, said computer system being operated by a user through a user interface, said method comprising the steps of:

using the Forth collection of programming environment building blocks to create a finite state machine language and an object oriented language;

using said Forth collection of programming building blocks, said finite state machine language and said object oriented language to define said external system as a plurality of objects, said plurality of objects consisting of a controlling object;

said objects comprising a plurality of data where said plurality of data describes said object; and

a plurality of operations that can be performed by said computer system on said plurality of data;

defining said controlling object as a finite state machine;

defining communication protocol between said finite state machine and said user through said user interface, said user inputs stimuli to said finite state machine and said user observes responses of said finite state machine to said input stimuli;

determining a closest match between said object and a previously defined object;

selecting said closest match and creating a new object based on said closest match;

defining said plurality of data for said object; and

defining said plurality of operations for said object.

5. A method as claimed in claim 4 wherein each of said steps of defining said controlling object and said system as finite state machines comprises the steps of:

defining a plurality of states that said finite state machine can assume;

defining a next state transition pair, for each of said plurality of states said next state transition pair describes a next state for said finite state machine;

defining an action routine for each of said next state transition pair, said action routine describes said responses said computer will output to said user through said user interface when said finite state machine transitions to said next state.

6. A method as claimed in claim 5 wherein each of said steps of defining said controlling object and said system as finite state machines further comprises the steps of:

for each of said plurality of states, defining only valid inputs;

defining said next state for each of said valid inputs; and

defining said action routine for each of said valid inputs.