EP0579302A1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for the automatic generation of test sequences
Assignee: Koninklijke PTT Nederland NV
•
Filing: 1993-06-18
•
Granted: —
•
Expires: 2013-06-18
Abstract
Abstract Method for the automatic generation, from a system or protocol specified as an FSM, of unique test sequences in order to establish whether or not the implementation is in a particular state. On the basis of the FSM a table comprising legal possibilities is generated for each state, as well as a series of tables comprising legal impossibilities for the remaining states. Unique test sequences are found by selecting those 10 sequences which occur in the "possibilities table" and in all the "impossibilities tables". If required, the shortest UIO sequence can be selected therefrom.
Inventors
- 👤 Stephanus Pieter Van De Burgt
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-09 07:21
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/3183; G01R31/318371
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
329 words
Method for the automatic generation, from a system or protocol specified as an FSM, of sequences of input signals, which are to be supplied to a system to be tested, together with the associated output signals which are to be received from the system to be tested and which serve to establish whether or not the implementation is in a particular state, CHARACTERISED BY a first step in which the FSM is converted into a first table containing input-output signals and associated start and end states; a second step in which, for a particular state, a second table is generated by copying the first table and, in doing so, marking that state as a start state and all the other states as a valid end state; a third step in which for each of the other states a third table is generated by copying the first or the second table, adding thereto at least one escape state and, in those third tables, in each case marking that other state as a start state and that escape state as a valid end state for all invalid input-output signals; a fourth step in which a fourth table is generated by logically combining the second table with all the third tables to give combination states which occur both in the second and in all the third tables, that combination state being marked as a start state which is marked as a start state in both the second and in all the third tables, and all those combination states being marked as an end state which are marked as an end state in both the second and in all the third tables; a fifth step in which each sequence of input-output signals from the fourth table, starting from a combination state marked as a start state and ending in a combination state marked as an end state, is selected as one of the desired test sequences and is stored in a fifth table.
Claim 2
Dependent Claim
329 words
Method for the automatic generation, from a system or protocol specified as an FSM, of sequences of input signals, which are to be supplied to a system to be tested, together with the associated output signals which are to be received from the system to be tested and which serve to establish whether or not the implementation is in a particular state, CHARACTERISED BY a first step in which the FSM is converted into a first table containing input-output signals and associated start and end states; a second step in which, for a particular state, a second table is generated by copying the first table and, in doing so, marking that state as a start state and all the other states as a valid end state; a third step in which for each of the other states a third table is generated by copying the first or the second table, adding thereto at least one escape state and, in those third tables, in each case marking that other state as a start state and that escape state as a valid end state for all invalid input-output signals; a fourth step in which a fourth table is generated by logically combining the second table with all the third tables to give combination states which occur both in the second and in all the third tables, that combination state being marked as a start state which is marked as a start state in both the second and in all the third tables, and all those combination states being marked as an end state which are marked as an end state in both the second and in all the third tables; a fifth step in which each sequence of input-output signals from the fourth table, starting from a combination state marked as a start state and ending in a combination state marked as an end state, is selected as one of the desired test sequences and is stored in a fifth table.
Claim 3
Dependent Claim
23 words
Method according to Claim 1, CHARACTERISED IN THAT the second and subsequent steps are carried out for only one state of the FSM.
Claim 4
Dependent Claim
21 words
Method according to Claim 2, CHARACTERISED IN THAT those steps are carried out only for the start state of the FSM.
Claim 5
Dependent Claim
23 words
Method according to Claim 1, CHARACTERISED IN THAT the second and subsequent steps are carried out for all the states of the FSM.
Claim 6
Dependent Claim
247 words
Method according to Claim 4, CHARACTERISED IN THAT in the second step for all states a second table is generated by copying the first table and, in doing so, marking those various states as a start state in the various second tables, and all the other states as a valid end state; in the third step a third table is generated for all the states by copying the first or the second table, adding thereto at least one escape state and in each case marking those various states as a start state in those various third tables and that escape state as a valid end state for all invalid input-output signals; a fourth step, in which a fourth table is generated by logically combining the second tables with the third tables as indicated, resulting in combination states which occur both in the second and in all the third tables, those combination states being marked as a start state which are marked as a start state in both the second and in the third tables, and all those combination states being marked as an end state which are marked as an end state in both the second and in the third tables; a fifth step in which the sequences of input-output signals which start with a combination state marked as a start state and end in a combination state marked as an end state are selected as a desired test sequence and are stored in the fifth table.
References Cited (Backward Citations)
US4692921A
Cited
US4991176A
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.