JPH0719216B2 - Operation confirmation method for computers in the network - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system for checking operation of a computer in a network, and more particularly, to accurately determine the state of state transition in a computer in a network by another arbitrary computer. A method for checking the operation of a computer in a network that can be quickly and easily grasped.

[Conventional technology]

Conventionally, as a test / verification method for confirming the operation of an arbitrary computer in an electronic computer network, in order to determine whether or not the computer software is operating as designed,
A method is known in which a test scenario is created in advance and the operation is confirmed according to the test scenario. here,
A test scenario is an arbitrary data input or command (hereinafter, command) to a computer under test (computer under test).
In response to the "event"), the response of the computer software is output as response data, and the combination of the input / output data is used to recognize the status of the software. This “state” represents, for example, when a certain computer is currently operating with which task, which module, and what kind of operation. When there is an event input, the state of the computer changes according to a predetermined scenario each time.Therefore, by checking the event input and the response output data, the state of the computer before and after the transition is performed. Can be predicted (estimated).

Further, in the above-mentioned conventional network, when the test / verification of a computer existing in a remote place is to be carried out, a visit to the site is carried out, and the test / verification is carried out using the above-mentioned test scenario.

As an example of this type of test / verification method in which the transition state of a computer is obtained by prediction (estimation) instead of actual data, there is JP-A-61-72451.

In the method described in the above publication, an event buffer area is provided in the main storage device, a record of the transmission state transition of the own station is stored in the event buffer (of its own station), and a text is written to the other station. When sending, the communication control unit sends the text to the partner station side, and when it completes, the event
The buffer stores a notification of completion of text transmission, and also stores state transition data during text transmission. Further, when the text is received, the communication control device stores the text reception notification in the event buffer and also stores the state transition data in the text transmission. That is, according to the conventional technique, only the own state transition information is stored in the own buffer, and the state transition information is not sent to the other party.

[Problems to be Solved by the Invention]

 The above conventional technique has the following problems.

(1) In the test / verification method based on the test scenario, not only the input / output must be repeated several times in order to detect (determine) one state of the software, but in some cases, There are some cases in which it is impossible to determine whether the state A transits to the state C or the state B transits to the state C. This is because there may be many different state transitions for the same input / output combination once or several times. Therefore, the above-mentioned prediction (estimation) method determines only one state transition. Because you can't. in this way,
Predict (estimate) the transition state of the partner station, not the actual data
However, the accuracy of the verification is poor and the reliability is problematic, and as the number of inputs and outputs increases, the efficiency also deteriorates, resulting in a problem of time and cost.

In addition, the method of going to a computer existing in a remote place to perform verification is inefficient, and requires manpower and time.

Therefore, in the computer network, even for computers located in remote areas, it is accurate and easy from a familiar computer,
It is desirable to establish a test / verification method that can be done speedily and at low cost.

(2) The data terminal device has a plurality of partner stations at the same time,
When sending a text to a plurality of partner stations, no consideration was given to the fact that the capacity of the event buffer in the main memory is required for the number of partner stations, and there was a problem with the memory capacity.

(3) No consideration is given to the case where the confirmation is deviated from the transmission state transition recorded in the event buffer. That is, as described in (1) above, since it is not the actual transition information but the predicted information, there is a problem that it cannot be detected when a malfunction occurs.

(4) If the transmission state transition record changes due to software change or replacement, it has to be re-recorded in the event buffer, and there is a problem in the time spent for maintenance and the risk of misrecognition accompanying it. .

(5) Since the state transition of the partner station is predicted by its own computer, the data storage order of the state transition may be reversed when text transmission and text reception occur at the same time, and malfunction may occur. There was a problem.

Therefore, the object of the present invention is to solve the above-mentioned problems of the conventional technology, and to uniquely confirm the state of state transition of an arbitrary computer with one input / output, thereby performing highly reliable verification. (EN) It is possible to provide an operation confirmation system for a computer in a network that can detect state transition information that is simple and versatile from a remote place without human intervention.

[Means for Solving the Problems]

In order to achieve the above-mentioned object, the operation confirmation method of the computer in the network of the present invention is usually the response text from the computer under test (computer to be tested) to the text input from the tester computer (computer performing the test). In addition to the response text of the above, a means for adding state information (hereinafter referred to as "state transition information", "transition information", or "status information") in the tested part of the computer under test is provided. Characterize.

It also applies when the tester computer is remote from the computer under test.

It is desirable that the state transition information (status information) added to the response text be the current state transition information (current status) and the previous state transition information (previous status). Therefore, the unit under test is provided with these two state transition information storage tables.

The state transition information (test scenario) of the unit under test created in advance may be stored in the tester computer, but it is stored in the unit under test and compared here with the actual state transition information for comparison. The result can be added to the response text and sent to the tester calculator.

The state transition information may be added in a form included in the response text as a part of the response text, or a text dedicated to the transition information may be created separately from the response text and sent to the tester computer. Data that corresponds to the response text (for example, data such as a time value) can be added to this transition information dedicated text.

[Action]

 The operation of the above configuration will be described.

According to the present invention, the response text sent from the computer under test to the tester computer includes the conventional response text,
Since the actual state transition information of the unit under test is added, the state or state transition of the unit under test is simply estimated (predicted) (eg, it should be in A status or B status). Unlike the case of determining the situation described above, this situation can be accurately determined and confirmed, and there is no erroneous recognition.

Further, the operation when using two pieces of the current state transition information (current status) and the previous state transition information (previous status) as the state transition information is as follows.

When the unit to be tested starts up, it first initializes the “current status storage table” and the “previous status storage table”. When an event is input, the contents of the "current status storage table" are copied to the "previous status storage table".
After the transition, the transition destination status is stored in the "current status storage table".

After that, in the module for returning the response text in the tested part to the tester computer, the current status recorded in the table is stored in the "current status storing data unit" in the response text. Also, the previous status recorded in the table is stored in the "data unit for storing the previous status". Then, the response text is returned to the tester computer.

After receiving the response text, the tester computer recognizes the transition state of the software of the unit under test from the "current status storing data unit" and the "previous status storing data unit". .

〔Example〕

 Embodiments of the present invention will be described below with reference to the drawings.

First Embodiment First, a first embodiment of the present invention will be described with reference to FIGS. 1 to 11. First, an outline of the configuration and operation of this embodiment will be described with reference to FIGS.

FIG. 1 is a block diagram of the first embodiment, in which 1 is a computer A, 2 is a computer B, 3 is a computer C, and 4 is a packet switching network.
In this embodiment, it is assumed that the computer (A) 1 is the computer that performs the test, and the computers (B) 2 and (C) 3 are the computers that receive the test. 5 is an event text transmitted from the computer 1 to the computer 2, and 6 is a computer 2 which is a feature of this embodiment.
Is a tester part of the computer 1, 8 is a tested part of the computer 2, and 9 is a tested part of the computer 3.

FIG. 2 (a) shows the structure of the response text 6 according to the present embodiment, and the response text 6 includes the conventional response text portion 10
In addition to the above, it is configured by adding "previous (pre-event input) status information" 11 and "current (post-transition by event input) status information" 12. Here, the "conventional response text portion 10" includes an address, a reference number, a text size, a data length or a time value. FIG. 2B shows the structure of the above-mentioned "event text" 5, which is composed of the event 5a and various operands 5b.

FIG. 3 shows the table under test 1 provided on the parts under test 8, 9.
7 shows a configuration of 7, which is composed of a "status storage table one before (event input)" 13 and a "current (post transition by event input) status storage table" 14.

FIG. 4 shows a processing flow of the tester unit 7 of the computer (A) 1. Selection of computers to be tested / verified (10
0) After that, if the computer (B) 2 is selected as an example, a communication path is established (101) between the computer (A) 1 and the computer (B) 2. Select event type (1
02) and various operands are specified (103), and then the above (10) is entered in the above event column 5a in the above event text 5.
Embed the event type selected in 2). Also, the various operands designated in (103) (for example, the selected computer name) are embedded in the various operand fields 5b, and then this event text 5 is passed through the bucket exchange network 4 to be tested / verified by the computer 2 Sent to (10
5) Do. After that, through the processing of the unit under test in FIG. 5 (described later), the computer 1 is instructed by the computer 2 to execute the bucket exchange network 4
The response text 6 is received via (106), and the "previous (pre-event input) status information" 11 and the "current (post-transition) status information" 12 are extracted from the response text 6 (107), The above two status information 11 and 12 are displayed (108) to notify the operator. Since these pieces of information are the actual transition information of the unit under test 8,
Highly reliable, where the number for continuing the test / verification of the computer is (109), the event type selection (1
When the process returns to 02) and ends (109), the communication path is canceled (110). When testing / verifying another computer, (111) returns to the selection (100) of the computer to be tested / verified. If the test / verification of another computer is not performed (111), the process is terminated.

FIG. 5 shows a processing flow of the unit under test (8) of the computer (B) 2 which performs the test / verification. Event reception (112)
If No, the process is not performed, and if Yes, the contents of the "current status storage table" 14 are copied to the "previous status storage table" 13 (113). After the transition, the status of the transition destination is stored in the "current status storage table" 14 (114). In this way, the tables 13 and 14 are both updated. After that, in the “previous status information” 11 and the “current status information” 12 in the response text 6, the “previous (pre-event input) status storage table” 13 and the “current status” are respectively described. After filling in the updated contents of the "status storing table" (115) (115), the "response technuto" 6 is returned to the computer (A) 1 of the tester section 7 (116).

By adopting the protocol structure (event text 5 and response text 6) shown above, network 15
In, for example, when the unit under test 9 of the computer (C) 3 is the tester unit and the tester unit 7 of the computer (A) 1 is the unit under test, the unit under test of the computer (C) 3 is tested by the unit under test of the computer (A) 1. Can be tested / verified.

Next, FIGS. 6 to 8 are diagrams showing an example of general state transition to which this embodiment can be applied, and FIGS. 9 to 11 are other examples of the same general state transition. The characteristics of the present embodiment will be described in detail with reference to these two examples in comparison with the related art. (Note that in both of these two examples, transmission / reception is performed in accordance with the flow charts of FIGS. 4 and 5 above.) First, the examples of FIGS. 6 to 8 will be described.

FIG. 6 is an example of a state transition diagram of the unit under test 8. S ₀
When the status (initial state is S ₀ ) is 50, if you input e ₁ event or e ₃ event, it will transit to (54,55) S ₂ status 52, and if you input e ₂ event, it will be (61) S ₁ status 51.
Transition to. When S ₁ status 51, by entering the e ₁ event (53) without transition. Enter e ₂ event (60)
When transitioning to S ₀ status and inputting e ₃ event (59)
Transition to S ₂ status. When S ₂ status is 52, e ₁ ,
When an e ₂ or e ₃ event is input (56,57,58), the status changes to S ₀ .

FIG. 7 shows the state transition diagram of FIG. 6 in a status matrix. For example, when the e ₁ event is input in the S ₀ status, nothing is output (that is, output φ {empty set}) S ₂ Transition to status. Similarly, when the e ₃ event is input in the S ₂ status, O ₂ (output 2) is output and S ₀
Transition to.

FIG. 8 shows a test scenario for grasping the status of the status matrix of FIG. 7 and confirming the operation.

In the method according to the prior art, the response text of the computer (B) 2 consists only of the part 10 (conventional response text) in FIG. 2 and does not include the status information 11 and 12. Therefore, the tester unit 7 has no choice but to estimate the status of the computer (B) 2 from the output information 10. Now, if the status information 11 before the event input of the part under test 8 is the S ₀ status, according to the method of the prior art, if the e ₁ event is input, the response output φ at that time is checked and this S _It can be estimated that it was ₀ status (that is, the e ₁ event is input from FIG. 7 and the output is φ {empty set} only in S ₀ status). However, if the status information 11 before the above event input is the S ₁ status, as shown in item 2 of FIG. 8, it is estimated if you do not input e ₁ , e ₂ , e ₃ events in order. I can't. That is, when the e ₁ event is input, the output is O ₁ for both S ₁ and S ₂ status, so the previous status is S ₁ , S ₂
It is not possible to determine which of the above. (Cannot be discriminated except in S ₀ status). After the transition, if it is the S ₁ status before that, it transits to the S ₁ status, and if it is the S ₂ status, it transits to the S ₀ status. Then, entering e ₂ events can not be determined at the output φ to S _1, S ₀ status both when the S ₁ status to the S ₀ status, when the S ₀ status transitions to S ₁ status. After that, when the e ₃ event is input, the output in the S ₀ status is O ₂ , and the output in the S ₁ status is φ.
It can be identified as the one by the third event input.

Similarly, when the status information 11 before the event input is the S ₁ status, the events e ₁ , e ₂ , e ₃ must be sequentially input (see FIGS. 7 and 8). As described above, according to the conventional method, in order to know in which state the tested part 8 is in a certain arbitrary time, S ₁ status and S ₂
For status, you must enter 3 events each.

The actual status matrix is not a simple one, as shown in FIG. 7, with three events and three statuses. Therefore, the number of event inputs will increase further.

On the other hand, in the present embodiment, the response text 6 in which the previous status 11 and the current status 12 are added to the conventional response text (output information) 10 is sent to the tester unit 7. For example, when the previous status is S ₀ , the event input e ₁ is output 10 (in this case, an empty set φ), and the previous status S ₀ and the current status S ₂ are displayed together with the tester unit 7. Sent to.

Therefore, according to the present embodiment, regardless of the status, if one event is input, the status information 11 one before (before the event input) and the current status information 12 (after the transition) are displayed. Since the information can be directly checked and confirmed, and the information is not the predicted (estimated) information but the actual information, it is possible to obtain highly efficient and highly reliable information.

Next, the example (modification) of FIGS. 9 to 11 will be described. This modified example is an example in which the transition state is different depending on the condition in the program (for example, the value of an arbitrary variable such as more than or equal to some yen) even if the input and the output are the same. The boundary value is indicated by f ₀ in FIGS. 9 to 11.

FIG. 9 is a state transition diagram for explaining this modification.
In FIG. 9, when the S ₃ status 70, if there is e ₄ or e ₅ event input 76 or 82, S ₅ or S ₃ Status
If there is a transition to 72 or 70, and there is an e ₆ event input 77 or 81, the transition destination differs depending on the condition. If the condition ≧ f ₀ , the S ₅ status 72 is entered, and if the condition <f ₀ , the S ₄ status is entered. When S ₄ status 71, e ₄ , e ₅ or e ₆ event input 78, 80,
Or 79, S ₅ , S ₃ , or S ₅ status 72,70
Or 72, and in the S ₅ status 72, if there is an e ₄ , e ₅ , or e ₆ event input 73, 74, 75, all transition to the S ₃ status 70.

FIG. 10 shows the state transition diagram of FIG. 9 in a status matrix, and FIG. 11 shows the status transition diagram of FIG.
This is a test scenario for grasping the matrix status and confirming the operation.

In item numbers 1 and 2 in FIG. 11, event 5 is the same as e ₄ , the conventional response text part 10 is φ (empty set), and the current (after transition) status 12 is the same as S ₅ status. With the method by technology, it is possible to estimate that the current status is S ₅ (if the output for e ₄ input is φ, the current status is S ₅ only). It is impossible to estimate whether the status 11 of the previous) is the S ₃ status or the S ₄ status. In contrast, in the present embodiment, whether the transition to S ₃ status, is one of S ₄ status of the transition to the S ₅ status, the previous (event input ago) status 11 and the current (post-transition) You can find out by looking directly at status 12. The same applies to item number 3 and item number 4 in FIG.

Item No. 5 and No. 6 in Fig. 11 are one before (before event input)
The case where the status 11 of S is the S ₃ status is described. This is an example where the transition destination differs depending on the condition when the e ₆ event is input. In the method according to the prior art, when you do not know the condition f ₀ in the tester unit 7, S ₅ from S ₃ Status
In order to know whether it has transited to status or S ₄ status (in any case, the output is the same at O _3, it is impossible to determine), so as shown in item 5 and 6 of Fig. 11, the e ₆ event You have to enter it twice. In other words, when the condition is ≧ f ₀ by the second e ₆ event input, O ₃ ,
[Conditions] <φ of ₀ (empty set) and it depends on the conditions, so the transition state can be known for the first time.

On the other hand, if the protocol structure of this embodiment is used, the current status 12 and the previous status are combined and sent to the tester section as a response text, so that one event 5 is input in any status matrix. Then, the transition state can be known.

As described above, according to the present embodiment, the transition state of the unit under test 8 can be known from the actual information without using a wasteful memory unlike the conventional method. (When the transition state table created in advance is provided in the tester unit, the transition information of each unit under test is not necessarily the same, so the number of units under test is required.) Moreover, the input of one event causes the unit under test to be tested. Since the status information of the unit 8 can be known, the efficiency is very high, the reliability is high, and the versatility in the network is high.

Second Embodiment Next, a second embodiment of the present invention will be described with reference to FIG. 12, FIG. 2 (b), FIG. 3, FIG. 13, FIG. 14 and FIG.

FIG. 12 shows a block diagram of this embodiment, which includes a computer (A) 1, a computer (B) 2, a bucket exchange network 4, an event text 5, a tester section 7, a tested section 8, a conventional response text 10, And transition information dedicated text 20.

FIG. 2 (b) shows the structure of the event text 5, which is composed of an event 5a and various operands 5b.

FIG. 3 shows the structure of the unit-under-test table 17, which is composed of a "previous (pre-event input) status storage table" 13 and a "current (post-transition) status storage table" 14.

FIG. 13 shows the structure of the conventional response text 10 and the transition information dedicated text 20. The conventional response text 10 (the data content thereof is the same as the portion 10 of FIG. 2A) and the transition information dedicated text. A data unit 21 such as a time value is provided in 20 and the same numerical value is written each time. That is, a time value (year / month / day / hour / minute / second) is written in the data unit 21 in order to make the correspondence between the “conventional response text” and the “transition information dedicated text” in the computer. However, any data other than the time value may be used as long as the data can be associated. In addition, the transition information dedicated text 20 is provided with a data unit of "previous (pre-event input) status information" 11 and a "current (post-transition) status information" 12.

FIG. 14 shows a processing flow of the tester unit 7 of the computer (A) 1. First, a computer to be tested / verified is selected (100) (computer (B) 2 in this embodiment) and a communication path is established (101). Select event type (10
2) Then, after specifying various operands (103) accordingly, various operands and the like are embedded in the selected event text 5 (104). Then, the event text 5 is transmitted to the unit under test 8 (105).

After the tested part 8 performs the processing shown in FIG. 15 (described later),
The conventional response text 10 is received (150) and the transition information dedicated text 20 is received (151). From the value of the data unit 21 such as the time value, the conventional response text 10 and the transition information dedicated text 20 are associated (152), and the transition information dedicated text 20 is read as "one before (event input)".
Status information ”11 and“ current (post-transition) status information ”12 (107), and display the above two status information 11 and 12 and various processes (108) (for example, input event 5 and status information 11). , 12 and output 10 are displayed and printed in a set.). It is judged whether the test / verification of the computer is continued (109), and if it is done, the process returns to the event type selection (102), and if it is ended, the communication route is canceled (1
After performing 10), determine whether to test / verify another computer (111), and if yes, return to “Selecting a computer to test / verify” (100). If not, perform this process. finish.

FIG. 15 shows a processing flow of the unit under test 8 of the computer (B) 2. Event text transmission in Fig. 14 (105)
After that, when receiving the event (112), the unit under test 8 writes the contents of the “current (post-transition) status storage table” 14 into the “previous (pre-event input) status storage table” 13 ( 113). After the transition (153), the status of the transition destination is written in the "current (after transition) status storage table" 14 (114). Next, the same time value is embedded in the "data unit for time value etc." 21 in the "conventional response text" 10 and the "transition information dedicated text" 20 (154). And reply the conventional response text 10 (155)
Then, the contents of “current (after transition) status storage table” 14 and “previous (before event input) status storage table” 13 are added to “current (transition)” in “transition information dedicated text” 20, respectively. Write the status information "after" to the data unit of "12" and the status unit of "status information of one before (event input)" (156), and send the transition information dedicated text 20 to the tester unit 7 (157). ,
The process ends.

As described above, according to the present exemplary embodiment, the transition information is transmitted to the tested part 8 by using the dedicated text different from the conventional response text 10.
From the tester part 7 to the tester part 7, the text dedicated to the transition information for some event texts 5
Therefore, it is effective that the transition information can be collectively extracted at one time like the batch processing.

Third Embodiment Next, a third embodiment of this embodiment is shown in FIG. 16, FIG. 2 (b),
This will be described with reference to FIGS. 17, 18, 19, 19, and 20.

FIG. 16 shows a block diagram of this embodiment, which is a computer (A) 1, a computer (B) 2, a bucket exchange network 4, an event text 5, a tester section 7, a tested section 8, a tested section transition information table. It consists of 30, response text 31.

FIG. 2 (b) shows the structure of the event text 5, which is composed of an event 5a and various operands 5b.

FIG. 17 shows the structure of the response text of this embodiment, which is “conventional response text part” 10, “previous (before event input) status information” 11 and “current (after transition) status information” 12 And the “determination result data unit” 32.

FIG. 18 shows the configuration of the unit-under-test table 36 of the present embodiment, which includes a “previous (pre-event input) status storage table” 13 and a “current (post-transition) status storage table” 14 It is composed of an "event storage table" 33, an "output storage table" 34, and a "judgment result table" 35.

FIG. 19 shows the structure of the “tested part transition information table” 30 existing in the tested part 8 (created in advance),
All possible "events" 5, "previous (before event input) status information" 11, "current (after transition) status information" 12 and "conventional response text (output)" 10
It is a table (composition of its own state transition information storage) recording the combination of.

FIG. 4 shows a processing flow of the tester unit 7 of the computer (A) 1. First, select the computer to test / verify (10
0) is performed (computer (B) 2 in this embodiment) and the communication path is established (101). After selecting an event type (102) and specifying various operands (103) accordingly, various operands and the like are embedded in the selected event text 5 (104). Then, the event text 5 is transmitted to the unit under test 8 (105).

After the tested part 8 performs the processing shown in FIG. 20 (described later), the response text 31 according to the present embodiment is received (106). From the response text 31 according to the above-described embodiment, "previous (pre-event input) status information" 11, "current (after transition) status information" 12, "conventional response text (output)" 10 and "judgment" All the values of the "result data unit" 32 are taken out (107) and displayed (108). here,
Since the determination result is "abnormal" when it is "0" and "normal" when it is "1", this is also displayed or printed (various processes). After that, it is judged whether the test / verification of the computer is continued (109), if it is done, the process returns to the selection of the event type (102), and if it is finished, the communication route is canceled (110), and then the other computer's Determining whether to test / verify (111)
If you do, perform "selection of computer to test / verify"
Return to (100), and if not performed, end this processing.

FIG. 20 shows a processing flow of the unit under test 8 of the computer (B) 2. Event text transmission of Figure 4 (105)
After that, the unit under test 8 receives the event (112) and writes the type of the event 5 in the “event storage table” 33 (160). Next, the contents of the "current (after transition) status storage table" 14 are written into the "previous (before event input) status storage table" 13 (113). After the transition (161), the status of the transition destination is written in the "current (after transition) status storage table" 14 (11
Four). After that, the output to be embedded in the "conventional response text" 10 of the "response text" 31 according to this embodiment is also written in the "output storage table" 34 (162). Next, the "previous (pre-event input) status storage table" 13 and "current (post-transition) status storage table" 14 and "event storage table" of the "test part table" 36 of the present embodiment It is searched whether a combination of the contents of "33" and "output storage table" 34 exists in the "tested part transition information table" 30 (163), and a judgment means (comparing means) not shown makes a judgment (164). ) Do. If it exists, it is “normal” and therefore “1” is written to the “judgment result table” 35 (166). If it does not exist, it is “abnormal” and “0” is written to the “judgment result table” 35 (165). ).

Next, the "output storage table" 34, the "previous (before event input) status storage table" 13, the "current (after transition) status storage table" 14, and the "judgment result table" The contents of 35 are the data of "conventional response text part" 10, "previous (before event input) status information" 11, "current (after transition) status information" 12, and "judgment result" 32, respectively. Fill the unit (167). Then, the “response text” 31 according to the present embodiment
Is returned to the tester unit 7 (116), and the process ends.

As described above, according to this embodiment, there are the following 1 and 2 effects.

1. The operator in the tester unit 7 uses the above-mentioned "status information of one before (event input)" 11 and "current (post-transition) status information" 12 which are transition information of the tested part 8
Even if the status matrix is not checked (or the status before and after the transition is not tracked), the value of the judgment result data unit 32 (“1” = normal, Since “0” = “abnormal”) can be automatically obtained, the test / verification can be performed accurately and efficiently in time.

2. If the tester unit 7 is provided with the transition information table of the unit under test 8, the software as the unit under test 8 is not necessarily the same, so it is necessary to have as many transition information tables as the units under test 8. should not. However, in the present embodiment, each tested part 8 need only have its own transition information table, so that the memory of the tester part 7 is not wasted and can be used efficiently.

Further, in the first to third embodiments described above, the two statuses of "current" and "one before" are included, but the status of the abnormality can be further added to form the response text.

In each of the above embodiments, by exchanging the tester portion and the tester portion, it is possible to test / verify other computers from any computer in the network, which is highly versatile and economically superior. effective.

〔The invention's effect〕

As described in detail above, according to the present invention, the normal response text to which the program under test of the computer under test responds to the normal response text, and the previous and current state transition of the program under test itself. Since I added information,
It is not just prediction or guessing, but the real state and state of state transition before and after the event input of the program itself, which is the tested part of another computer, from any computer in real time, without using a special dedicated device or diagnostic program. As a result of accurate confirmation (testing and verification), there is an effect that efficient and highly reliable operation confirmation is performed.

Further, even when the computers are separated from each other, it is possible to make a correct decision from the familiar computer in a short time with the actual state transition information (status) without going to the site.

Further, when the state transition information table created in advance is provided in the device under test, the required memory capacity can be reduced as compared with the case where the table is provided in the tester section.

[Brief description of drawings]

FIG. 1 is a block diagram of the first embodiment of the present invention, FIG. 2 is a block diagram of response text and event text, FIG. 3 is a block diagram of a table under test, and FIG. 4 shows processing of a tester computer. Flow chart, FIG. 5 is a flow chart showing the processing of the portion to be tested, FIG. 6 is a general state transition diagram applied to the first embodiment of the present invention, and FIG. 7 is a status matrix of FIG. FIG. 8 is a block diagram showing an example of the test scenario of FIG. 7, FIG. 9 is another general state transition diagram applied to the first embodiment of the present invention, FIG.
FIG. 10 is a block diagram showing an example of the status matrix of FIG. 9, FIG. 11 is a block diagram showing an example of the test scenario of FIGS. 9 and 10, and FIG. 12 is a block diagram of the second embodiment of the present invention. Configuration diagram, FIG. 13 is a configuration diagram of a response text part and a transition information dedicated text of the second embodiment, FIG. 14 is a flow chart showing processing of a tester part of the second embodiment, and FIG. 15 is a second embodiment. 16 is a flow chart showing the processing of the portion to be tested, FIG. 16 is a block diagram of the third embodiment of the present invention, FIG. 17 is a block diagram of the response text of the second embodiment, and FIG. 18 is the second embodiment. FIG. 19 is a configuration diagram of a work table in the unit under test, FIG. 19 is a configuration diagram of a transition information table of the unit under test of the second embodiment, and FIG. 20 is a flow chart showing processing of the unit under test of the second embodiment. 1 ... Computer A, 2 ... Computer B, 3 ... Computer C, 4
…… Packet exchange network, 5 …… Event text, 5a ……
Event column, 5b ... Various operand columns, 6 ... Response text according to the present invention, 7 ... Tester section, 8 ... Tested section, 9 ... Tested section, 10 ... Conventional response text, 11
...... Status information of the previous one (before event input), 12 ...
… Current (after transition) status information, 13 …… Previous (before event input) status storage table, 14 …… Current (after transition) status storage table, 15 …… Network, 16 …… Number of input events, 17 ... Tested table, 20 ... Transition information dedicated text, 21 ... Time unit data unit, 30 ... Tested portion transition information table, 31 ... Response text, 32 ... Judgment Result data unit, 33 ... Event storage table, 34 ... Output storage table, 35 ... Judgment result table, 36 ... Tested part table, 50-52 ... Status, 53-61 ... Event, 70
~ 72 …… Status, 73 ～ 82 …… Event, 100 ～ 111…
… Steps of processing flow of tester computer, 112-116 ……
Steps of the processing flow of the tested part, 150 to 152 ... Steps of the processing flow of the tester part, 153 to 157 ... Steps of the processing flow of the tested part, 160 to 167 ... Steps of the processing flow of the tested part.

Claims (7)

[Claims] 1. A text input from a tester computer in an operation confirmation system of a computer in a network in which a tester computer confirms the operation of a unit under test in another computer under test between arbitrary computers in the network. A means for adding the previous and current state transition information of the program under test to the normal response text to which the program under test of the computer under test responds. A method for checking the operation of computers in the network. 2. The tester computer, based on the received state transition information, means for transmitting the text to the computer under test, means for receiving state transition information from the computer under test, and The operation confirmation system for a computer in a network according to claim 1, further comprising means for confirming a substance of a state transition of a tested part of the test computer at a remote location. 3. The operation confirming method for a computer in a network according to claim 1, wherein the unit under test is provided with a table for storing current state transition information and a table for storing previous state transition information. . 4. The device under test outputs a response text to which the state transition information is not added to the text input from the tester computer, and the state transition information is transmitted by a transition information dedicated text different from the response text. The operation confirmation system for a computer in a network according to claim 1, characterized in that the operation is confirmed. 5. The operation confirming method for a computer in a network according to claim 4, wherein data corresponding to said response text is added to said transition information dedicated text. 6. The operation confirmation method for a computer in a network according to claim 1, wherein the state transition information includes state information before and after the transition. 7. The state transition information of the computer under test is created and stored in advance in the unit under test, and when the text is input, the actual state transition information and the state transition information created and stored in advance are stored. 7. An operation confirmation system for a computer in a network according to claim 1, 4, 5, or 6, further comprising means for comparing the comparison result and the result of comparison and adding the comparison result to the response text.