Analyzing an extended finite state machine system model

• US 6,853,963 B1
• Filed: 05/25/1999
• Issued: 02/08/2005
• Est. Priority Date: 05/25/1999
• Status: Expired due to Term

• Current Assignee: Empirix Incorporated (Empirix Holdings I, Inc.)
• Original Assignee: Empirix Incorporated (Empirix Holdings I, Inc.)
• Inventors: Apfelbaum, Larry, Lynch, Thomas, Savage, Peter L., Vaswani, Ramesh, Doyle, John D., Trumpler, Mark
• Primary Examiner(s): PHAN, THAI Q
• Application Number:
  US09/318,286
• Time in Patent Office: 2,086 Days
• Field of Search: 703/2, 703/20, 703/27, 703/14, 703/17, 714/724, 714/1, 345/418, 717/8, 717/126, 717/131
• US Class Current: 703/2
• CPC Class Codes: G06F 11/3604 Software analysis for verifying properties of programs byte-code verification G06F9/44589
• CPC Class Codes: G06F 11/3664 Environments for testing or debugging software
• CPC Class Codes: G06F 11/3692 for test results analysis

Abstract

A method of using a computer to analyze an extended finite state machine model of a system includes providing a graphical user interface that presents a table of rows, receiving data in at least one table row, and determining at least one path through the states and transitions of the extended finite state machine model using at least one of the rows in the table.

Claims

1. A method of using a computer to analyze an extended finite state machine model of a system, the model having states interconnected by transitions, the method comprising:

providing a graphical user interface that presents a table of rows;

receiving data in at least one table row, said table row storing one of a likelihood value and a probability value; and

determining at least one path through the extended finite state machine model using at least one of the rows in the table, the extended finite state machine model being traversed by making calls to the model and traversing transitions through the model, each call to a model making an instance of that model.

2. The method of claim 1, wherein in at least one table row comprises a transition between model states of said extended finite state machine.

3. The method of claim 1, wherein the rows store at least one of the following:

an assignment, a predicate, and a constraint.

4. The method of claim 1, wherein receiving data comprises receiving data from a user.

5. The method of claim 1, wherein receiving data comprises importing data from a data source.

6. A method of using a computer to analyze an extended finite state machine model of a system, the model having states interconnected by transitions, the method comprising:

receiving an identification of a data source;

importing data from the data source, said data comprising one of a likelihood value and a probability value;

determining at least one path of states and transitions through the extended finite state machine model using the imported data, the extended finite state machine model being traversed by making calls to the model and traversing transitions through the model, each call to a model making an instance of that model.

7. The method of claim 6, where the data source comprises at least one of the following:

a file, a database, and a spreadsheet.

8. The method of claim 6, wherein the data comprises at least one of the following:

an assignment, a predicate, and a constraint.

9. The method of claim 6, wherein the data comprises at least one transition between two states.

10. A computer program product, disposed on a computer readable medium, for analyzing an extended finite state machine model of a system, the model having states interconnected by transitions, the computer program product including instructions for causing a processor to:

provide a graphical user interface that presents a table of rows;

receive data in at least one table row, said table row storing one of a likelihood value and a probability value; and

determine at least one path through the extended finite state machine model using at least one of the rows in the table, the extended finite state machine model being traversed by making calls to the model and traversing transitions through the model, each call to a model making an instance of that model.

11. The computer program product of claim 10, wherein in at least one table row comprises a transition between model states.

12. The computer program product of claim 10, wherein the rows store at least one of the following:

an assignment, a predicate, and a constraint.

13. The computer program product of claim 10, wherein the instructions for receiving data comprise instructions for receiving data from a user.

14. The computer program of claim 10, wherein the instructions for receiving data comprise instructions for importing data from a data source.

15. A computer program product, disposed on a computer readable medium, for analyzing an extended finite state machine model of a system, the model having states interconnected by transitions, the computer program product including instructions for causing a processor to:

receive an identification of a data source;

import data from the data source, wherein the data comprises at least one of a likelihood value and a probability value; and

determine at least one path of states and transitions through the extended finite state machine model using the imported data, the extended finite state machine model being traversed by making calls to the model and traversing transitions through the model, each call to a model making an instance of that model.

16. The computer program product of claim 15, wherein the data source comprises at least one of the following:

a file, a database, and a spreadsheet.

17. A computer program product for analyzing an extended finite state machine model of a system, the model having states interconnected by transitions, the computer program product including instructions for causing a processor to:

receive likelihood or probability values for a plurality of transitions between two states;

determine at least one path through the extended finite state machine model states and transitions by selecting one of the transitions for inclusion in the path based on the likelihood or probability values, the extended finite state machine model being traversed by making calls to the model and traversing transitions through the model, each call to a model making an instance of that model; and

determine eligible transitions during the determining of at least one path, and

wherein selection one of the transitions comprises selecting one of the transitions based on the likelihood or probability values of the eligible transitions.

18. The computer program product of claim 17, further comprising instructions for causing the processor to normalize the likelihood values to produce a probability values.

19. The computer program product of claim 17 wherein the data comprises one of an assignment, a predicate and a constraint.