JPH083729B2 - Motion prediction device - Google Patents

Description

The present invention relates to an operation predicting apparatus for predicting the operation of an apparatus such as a copying machine or a laser beam printer in which control is performed in parallel.

[Prior Art] In a system including a plurality of processing units each having an independent processing function such as a copying machine or a laser beam printer and controlling them in parallel, a control program for executing the control is inspected. First, it is necessary to predict all possible behaviors of the system. Such prediction methods are roughly classified into the following three methods.

 Behavior prediction based on specifications.

A mathematical behavior prediction method based on the specification method based on the Petri net.

 Motion prediction from program code.

 A series of static structural tests called the coverage test.

 Motion prediction using an actual model.

There is a method of actually controlling the system by using an ICE (In Circuit Emulator) or the like and operating the system in a state close to the actual operation to make a prediction.

[Problems to be Solved by the Invention] However, the above-described conventional inspection method has the following problems.

 Behavior prediction against specifications.

In the description based on the Petri net, the control state of each unit that constitutes the system to be controlled, their order, and the time constraint between each unit are expressed by the same definition element of transition and arc. For this reason, it is difficult to grasp the control procedure unique to each unit in the system to be controlled. For this reason, it is difficult to intuitively grasp the relationship between the system structure and the specifications. Also, with this description method, not only is it difficult to describe the specifications of the system, but there are many problems in terms of understanding and maintenance of the described specifications, so it is not specified in the prediction of system operation. Is the current situation.

In addition, as a method for describing the specifications of ordinary real-time systems, first, by describing an independent state transition diagram for each unit, we show each control state for each unit and the order constraint between them, and In order to operate as a system in cooperation with each other, the context of the control state between units is supplemented by a separate timing chart or document. However, even with this, it is difficult to predict the operation of the system, and there is no method for it.

 Motion prediction from program code.

In the coverage test for the conventional source code,
You can test over almost the entire static structure of a program. However, it is not possible to predict the operation of the system because it does not follow the execution order of all the programs that can occur during operation of the system.

 Motion prediction using actual equipment.

In the operation prediction using an actual device such as ICE, it is possible to predict the environment in which the system is placed in advance and perform the operation that is considered to occur under the environment while performing the prediction. However, it is difficult to predict all the environment in which the system is placed, and it is also difficult to predict all the operations under the environment. In general, in developing such a control system, it is important to predict the operation of the system at the stage of creating the system specifications, because the cost required for modifying the program etc. is lower at the early stages of the development process. It is believed that. On the contrary, the operation prediction by ICE etc. is performed at the end of the development process, and there is a problem in the measuring method using an actual device in this respect as well.

The present invention has been made in view of the above conventional example, and an operation prediction device capable of confirming the possible states of the system by predicting the possible states of the system based on the specification information of the system. The purpose is to provide.

[Means for Solving the Problem] In order to achieve the above object, the motion prediction apparatus of the present invention has the following configuration. That is, for each processing element of the plurality of processing elements included in the system, the element state storage means for storing the possible states and the transition order of the state, and the transition of the state of each processing element,
A combination of a transition condition storage unit that stores a state or a state transition in another processing element that is a condition of the transition and a state of each processing element is set as a system state of the system, and an initial state of a given system is initialized. As a value
Current system state storage means for updating and storing the current system state, current system state stored in the current system state storage means, possible states of each processing element stored in the element state storage means, and the state The candidate stored in the current system state storage means for each candidate of the next system state created by the candidate creating means based on the transition order of Determining means for determining whether or not it is possible to make a transition from the system state, system state storing means for storing a candidate for the next system state determined to be possible by the determining means together with the transition order of the state, and the current system. The state storage means updates and stores the next system state candidate determined to be transitable by the determination means as a new current system state. And control means for controlling so as to repeat the creation of candidate for the next system state by the candidate creating unit, based on the stored contents of the system state storage means,
A state diagram creating means for creating an operation state diagram of the system.

[Operation] In the above configuration, the candidates are based on the current system state stored in the current system state storage means, the possible states of each processing element stored in the element state storage means, and the transition order of the states. The creating unit creates a candidate for the next system state, and the determining unit determines whether or not the current system state stored in the current system state storage unit can be transitioned to each of the created next system state candidates. , The next system state candidate determined to be transitable is stored in the system state storage means together with the transition order of the state. The control means
The current system state storage means updates and stores the next system state candidate determined to be transitionable as a new current system state, and controls to repeatedly create the next system state candidate by the candidate creating means. Then, the state diagram creating means creates an operation state diagram of the system based on the stored contents of the system state storing means.

[Embodiment] Hereinafter, a preferred embodiment of the present invention will be described in detail with reference to the accompanying drawings.

[Description of Overall Configuration (FIG. 1)] FIG. 1 is an overall configuration diagram showing an embodiment of the present invention.

In the figure, 10 is an input / output device equipped with a data input unit such as a keyboard and a data output unit such as a CRT, and an operator can use this input / output device 10 to input and output data in a conversational manner. I'm running. A specification editing unit 100 stores the specification of the parallel control system, which is input according to the real-time system description method described later and is input from the input / output device 10, in the file 1000 on the database as a specification chart. 200 is a system specification storage unit 120 based on the system specifications stored in the file 1000,
It is a code conversion unit that creates files 1110 to 1130 described later.

Explaining these files 1110-1130,
Is a UST file (Unit Sequence) that stores the control states of each unit in the system and the order relation between the control states.
ence table (hereinafter referred to as UST), 1120 is an IST file that stores the initial state of the system (hereinafter referred to as IST), and 1130 is an SRT file (System Restrait) that stores the time constraints that exist between units. table,
Hereinafter referred to as SRT).

A next state candidate selection unit 300 selects the next possible next state candidate based on the contents of the UST file 1110, the IST file 1120 and the working memory 20 and stores it in the working memory 20. 400 determines whether or not the next state candidate on the working memory 20 selected by the next state candidate selection unit 300 can make a transition based on the transition restriction information of the SRT file 1130. SST file 1200 (System Sequence Table below SS
(Referred to as “T”). 500 is
It is an SST creation end identifying unit that refers to the contents of the SST file 1200 and determines whether the creation of the SST file 1200 is completed.

Reference numeral 600 is a dynamic state creation unit that creates a dynamic state diagram 1300 based on the contents of the SST file 1200 of the database 110.
Reference numeral 700 is a dynamic state display unit that outputs the dynamic state diagram 1300 to the input / output unit 10 including a CRT and expresses it. Note that the above 10
Each unit from 0 to 700 is supported by a computer (which naturally has a processing unit, a memory for processing, a control memory for storing a processing procedure typified by a flow chart described later, and an interface for passing information) The working memory 20 is configured to be accessible by the respective units 100 to 700 described above. The details of the working memory 20 will be described later.

[Description of Specification Description System (FIGS. 2 to 12)] Before describing the operation of the system shown in FIG. 1, the specifications stored in the specification storage unit of the real-time system of this embodiment are defined. The specification description method of a real-time system is explained.

FIG. 2 is a diagram showing a description example of a graphic specification using the specification description method of the real-time system of this embodiment.

In the figure, as a specification description element for indicating the control sequence of each unit, a circular portion indicated by 1 indicates a control state, and 2 indicates a transition from one control state to the next control state. Further, as a specification description element for indicating a time constraint between units, 3 is a flag and 4 is a trigger. Less than,
These descriptive elements will be described in detail below.

The control state indicated by 1 is a descriptive element indicating an operation to be executed at a certain time among a plurality of operations executed by each unit constituting the system, and is indicated by a different symbol corresponding to the type of operation. . Here, all control states are described by circles, and each control action is named so that its action can be specified. As for these control states, as shown in FIG. 3, the unit can be connected with a flag 3 for notifying other units of the current control state.

The transition indicated by 2 is a descriptive element indicating the operation sequence of each unit, and is described here as a solid directed arc from a certain control state to the next control state. For the sake of simplicity, of the two control states connected by a certain transition, the control state that is executed earlier in time will be referred to as the front control state, and the subsequent control state will be referred to as the post control state. To do. Also, the transition from the pre-control state to the post-control state of a certain transition is called the execution of the transition, and the execution of this transition ends within the time that does not affect the operation of the system described in this specification description method. To do.

Further, a flag and a trigger can be connected to the transition as shown in FIG. 4 in order to define the timing for starting the execution of the transition. If the flag and the trigger are not connected, the transition is executed when the execution of the previous control state is completed. The transition when the flag 3 and the trigger 4 are connected will be described later. Also, the transition informs the other unit when it was executed, so that the trigger 4'output from the transition can be connected as in FIG.

 Next, the state transition by the flag will be described.

The flag 3 is a descriptive element that defines the time to start the execution of the transition depending on the execution status of the control state, and is represented by a symbol that associates the defined transition with at least one control state. Here, as indicated by 3 in FIG. 2, it is described as a directed arc of a broken line extending from a certain control state PA to a transition 2 whose execution point is to be defined.

FIG. 5 shows the time constraint regarding the transition at this time.

The control flag 3 is generated during the time period during which the control state PA _a is being executed, and the transition is permitted to be executed after the control state PA ₂ is ended.
A ₁ is started. In the unit b, PA _b is started after waiting for the end of execution of PA _a .

FIG. 6 collectively shows the execution conditions of the transition by the flag. As shown in FIG. 6, even if the flag is turned on, if the control state is in process, the transition is not executed immediately, but the transition is executed after waiting for the end of the main process.

 Next, the state transition caused by the trigger will be described.

Like the above-mentioned flag, the trigger is also a description element for defining the execution timing of a specific transition according to the execution status of the control state, and is expressed as a symbol that associates the specific transition with at least one other transition. Be done. This trigger forces the execution of certain other transitions when a transition is executed. The execution of the forced transition is the same as the execution of the transition from which the trigger originated, or the behavior of the system. It shall be completed within the time that does not affect the order.

This trigger is a transition (PA ₁ → PA ₂ ) as shown in Fig. 2.
Is described as a directed arc 4 of a double arrow with a broken line that goes from the transition to the transition (PA _a → PA _b ) for which the execution time is desired to be defined. The transition timing in this case is shown in FIG. Here, the execution of the transition from PA _a to PA _b is started when the transition from the control state PA ₁ connected to the trigger 4 to PA ₂ is executed. FIG. 8 is a diagram collectively showing the execution condition of the transition by the trigger. As is clear from FIG. 8, when the trigger is input, the transition is immediately executed regardless of the control state.

Next, the point that a more complicated transition timing can be defined by using these flags and triggers together will be described.

<Product of Multiple Flags> FIGS. 9A and 9B are diagrams showing an example in which a plurality of flags are combined to define the execution time point of a specific transition. Here, the product product relation of flags is shown. ○ is used as a symbol for

This connection relation is that execution of the transition (PA ₁ → PA ₂ ) associated with these flags is allowed only when all the control states from which these flags F1 to Fn are generated are in execution. , And conforms to the stipulation of the execution timing of the transition by the flag described above with reference to FIG. Therefore,
This post-combination flag is called a combination flag F ', and is treated in the same manner as the above-mentioned flag.

<Product of Multiple Triggers> FIGS. 10 (A) and (B) show an example in which a specific transition execution (PA ₁ → PA ₂ ) point is defined by combining multiple triggers (T1 to Tn). In the figure, ◯ is used as a symbol for indicating the connection relation of the product of triggers. This coupling relationship means that when all the transitions that are trigger sources occur at the same time, the specific transition (PA ₁ → P
A ₂ ) is forced to be executed, and it conforms to the time stipulation of the execution of the transition by the trigger described above with reference to FIG. Therefore, the combined trigger T'is called a combined trigger and is treated in the same manner as the above-mentioned trigger.

<Product of a plurality of triggers and flags> FIG. 11 is a diagram showing an example in which an execution point of a specific transition (PA ₁ → PA ₂ ) is defined by combining one trigger T and a plurality of flags F1 to Fn. , Here, ○ is used as a symbol indicating the combination of the product of the trigger and the flag.

This coupling relationship is such that these triggers T are generated when all the control states that are the sources of these flags F1 to Fn are in execution.
It indicates that the execution of the transition (PA ₁ → PA ₂ ) associated with these flags is permitted only when the transition (PA _x → PA _y ) that is the generation source of the occurs.

<Sum of arbitrary number of flags and triggers> Figure 12 is a diagram showing an example of using arbitrary number of flags, synthesis flags, triggers, synthesis triggers, etc. for the same transition in order to define the execution timing of a specific transition. Here, the execution of the transition occurs at the time when the transition is executed fastest among these conditions. This kind of connection is called the sum of flags and triggers. As a symbol for indicating this coupling relationship, here, a flag, a synthesis flag, a trigger, and a synthesis trigger are connected in parallel as much as necessary to a transition that gives a time constraint.

FIG. 13 shows the system specification storage unit 120 in this embodiment.
This is a flow chart showing the process of creating the file and the process of creating the RT and URT files. The description of this flow chart will be given later.

[Explanation of Specific Example of Specification Definition (FIGS. 13 to 17)] FIG. 14 (A) is a diagram showing an example in which system specifications are defined based on the specification description method of the real-time system described above. It defines the specifications of a thermostat consisting of three units: temperature sensor, cooler, and intermittent timer.
The operation of the thermostat defined in FIG. 14 (A) will be described below.

In the sequence of the temperature sensor, the state of waiting for the upper limit temperature is entered immediately after the power is turned on, and when the upper limit temperature is reached, a transition is made to the state of waiting for the lower limit temperature, which is notified to the cooler sequence by the flag 41. When the lower limit temperature is reached in the state S2, the trigger 42 (forced end signal) is sent to the cooler, the state transitions to the upper limit temperature waiting state S1 again, and this operation is repeated.

On the other hand, the cooler sequence is in the off state C1 immediately after the power is turned on, but while the sequence of the temperature sensor waits for the lower limit temperature (when the flag 41 is on), the timer starts the clock of the operating time ( When the trigger 43 is input), the cooler transitions to the on state C2. After that, when the sequence of the temperature sensor transits to the upper limit temperature waiting state or the measurement of the operation time ends (trigger 44 input), the cooler returns to the off state C1, and this operation is repeatedly executed.

In addition, in the intermittent timer sequence, after the power is turned on, the stop time counting state T1 and the operating time counting state T2 are repeatedly executed, and the trigger 43 or 44 is output to the cooler sequence at the end of each. There is.

For the sake of simplicity in the following description, the control state of each sequence is defined as S1, S2, C1, ... As shown in FIG. 14 (B).

Next, the flow chart of FIG. 13 will be described based on the operation defined in FIG.

First, at step S1, the operator uses the input / output device 10 to define the system specifications as shown in FIG. 14 using the specification chart editing unit 100. In step S2, the UST, IST, SRT file is created by the code conversion unit 200 based on the defined specifications. FIGS. 15 (A), (B), and (C) are diagrams showing examples of the contents of the UST, IST, and SRT files created based on FIG. 14 (A), respectively.

FIG. 15 (A) is a US showing the front control state and the rear control state.
FIG. 15 (B) is a diagram showing an example of contents of the T file, FIG. 15 (B) is a diagram showing an example of contents of the sequence constraint table (SRT file), and FIG. 15 (C) is a diagram showing an example of contents of the initial state table (IST file) 1120. .

As is clear from FIG. 15 (B), 50 indicates the condition in which the cooler makes a transition from the off state C1 to the on state C2. From this, the temperature sensor is in the lower limit temperature waiting state S2, and the timer is T1.
It can be seen that the transition from C1 to C2 is executed only when the transition from the operating time to T2 occurs. Also, as indicated by 51 and 52, the cooler is stopped (C2 → C1 transition) by the end of the lower limit temperature waiting S2 (S2 → S1) or the end of the operation time measurement (T2 → T1). To be done. FIG. 15 (C) shows an example of the contents of the IST file 1120. In the initial state, S1 and C
1, T1.

Next, in step S3, based on the current system state stored in the working memory 20, the next system state candidate that may possibly transit from this current system state is
Select based on the information in T-file 1120. If the current system status is (S1, C1, T1), it is shown in Fig. 15 (A).
Since the transition from C1 to C2 and from S1 to S2 is possible from UST, (S1, C2, T1), (S2, C1, T1), etc. are listed as candidates for the next system state. At step S4, it is judged whether the next system state candidates listed at step S3 can really transit from the current system state based on the information of the SRT file shown in FIG. 15 (B). An order relation of system states is added to the SST file 1200, which is an order relation storage unit of system states.

Thus, based on the above example, (S1, C1, T1) through (S
1, C2, T1) cannot be transited because it is defined by SRT1130, but from (S1, C1, T1) to (S2, C1, T1) and (S1, C1, T2)
Is not specified in SRT1200, so it can transition. In this way, for example, a set of (S1, C1, T1) and (S2, C1, T1) is registered in the SST file 1200 as the front system state and the rear system state, respectively.

FIG. 16 is a diagram showing an example of the SST file 1200 created in this way, and FIG. 16 (A) shows a system state that can be reached from the initial system state. FIG. 16 (B) is a view showing a part of the SST file 1200 thus created.

In step S5, it is checked whether all reachable system states in the system are checked, and if all are checked, the process proceeds to step S6, but if there is a system state that has not been checked yet, it is set as the current system state in step S3.
Repeat the following processing. For example, in the state of FIG. 16 (A), the rear system state (reachable system state)
Of these, (S1, C1, T2), (S2, C1, T1) and (S2, C1,
Since it is understood that the next state of T2) has not been examined, these states are set as the current system state, and the processes from step S3 onward are repeated until finally the SST file 120 shown in FIG. 16 (B) is reached.
Create 0.

In step S6, a dynamic state diagram 1300 representing the operating state of the system based on the specifications defined in step S1 is created based on the information in SST file 1200. Figure 17 is Figure 16 (B)
FIG. 15 is a dynamic state diagram showing the operation of the thermostat of FIG. 14 (A) created based on the SST file 1200 shown in FIG.

The dynamic state diagram created in this way is displayed on the CRT or the like of the input / output device 10 in step S7.

[Explanation of Processes A to B (FIGS. 18 to 21)] FIG. 18 is a diagram showing a memory configuration example of the working memory 20 at the time of executing the processes A and B in the flow chart of FIG. The working memory 20 is roughly divided into two parts, a data area shown in FIG. 18 (A) and a stack area shown in FIG. 18 (B).

The data area includes a pointer storage area A [], a pointer temporary storage area A '[], and a unit state storage area D.
[], A current system state storage area X [], a next system state candidate storage area Y [] for storing a candidate state of a post system state, a counter i, and a counter j are provided.

Next, a detailed description of processing A and processing B in the flow chart of FIG. 13 will be given in the case of the thermostat of FIG.

[Description of Process A (FIGS. 19 and 20)] FIGS. 19A and 19B are flow charts showing an example of the process A. This process A extracts all the next system state candidates from the current system state and the UST file 1110,
SR that is actually acquired as the next system state
The T file 1130 is referred to and selected and registered in the SST file 1200. As a method of realizing this processing A, (1) all the next system state candidates are listed, and then the transition possibility is judged for all of them.

(2) A method of repeating the operation of listing one next system state candidate and determining the possibility of transition for the next system state candidate until there is no next system state candidate.

There are two possible methods, but in consideration of memory efficiency, the method (2) will be described in detail here.

At the start of the process A, only the current system state X [] of the data area of the working memory 20 is initialized, and “EOD” is stored as a delimiter at the end of each storage area of the working memory 20. . The contents of the SST file 1200 are as shown in FIG. 20 (C).

To explain the flow chart of FIG. 19, first, the step
At S11, the control states stored in the current system state X [] for each unit currently being executed are checked. Among these control states, the current control state may be stored in the unit state storage area D [] because it may remain in the current state without transitioning to the next control state. In addition, when the current control state of each unit ends, it may transition to the next control state. Therefore, based on the UST file 1110, the current control state is set as the pre-control state.
It is stored in 20 unit state storage areas D []. At that time, the head address of each unit is stored in the pointer storage area A []. This is shown in FIG. 21.

In step S12, the contents of the pointer storage area A [] are copied to the pointer temporary storage area A '[], and the step is executed.
In step S13, the counter i is initialized to "0", and in step S14, the value pointed by the pointer in the pointer temporary storage area A '[] is copied to Y [] as the next system state candidate while incrementing the counter i. For example, as shown in FIG. 20 (A), pointer A '[] = {D + 0, D + 3, D + 6}
Then, the next system state candidate storage area Y
(S2, C1, T2) will be copied to [].

In step S15, the pointer in A '[] is incremented to point to the next next system state candidate,
At step S16, the counter j is initialized to "0". In step S17, it is stored in the storage area X [] of the current system state. Steps S17 and after are repeatedly executed until all the current system states are checked. When "EOD" is detected from the current system state storage area X [] and it can be detected that the inspection has been completed, X [] and Y [] are written in the pre-system state and the post-system state of SST, respectively. Then, push the next system state Y [] to the stack and store it.
Proceed to S21.

On the other hand, when there is the current system state stored in X [] at step S17, the process proceeds to step S18, and the counter j is used to select a corresponding pair of control states (PA) from X [] and Y []. It is checked whether or not the transitions that make them the pre-control state and the post-control state are registered in the SRT file 1130, and if they are not registered, the counter j is incremented and the process returns to step S17.

If a transition is registered in the SRT file 1130 in step S18, the flow advances to step S19 to check if the constraint condition from the current control state registered in X [] to the next control state of Y [] is satisfied. If the condition is not satisfied, add j
Then, the process returns to step S17, but if the conditions are satisfied, the process proceeds to step S20. In addition, the current control state of X [] is set to the pre-control state, and the next control state of Y [] is set to the post-control state. See if the transition is registered in SRT file 1130.

When in SRT file 1130, return to step S19,
If not, the process proceeds to step S21 and X is set using the counter i.
It is judged whether all the next system state candidates when [] is set as the current system state have been checked, and if not checked, the process returns to step S13.

[Explanation of Process B (FIG. 21)] FIG. 21 is a flow chart showing an example of the process B of FIG. In this processing B, it is determined whether the SST file 1200 has been created.

First, in step S31, it is determined whether or not the stack area shown in FIG. 21 (B) is empty. If it is empty, it is determined that the SST file 1200 has been created, and the processing is ended. If the stack is not empty, the process proceeds to step S32, one data is taken out from the stack pointed to by the stack pointer SP in the stack area (POP), and X is set as the current system state.
Store in []. Then, in step S33, it is determined whether or not the current system state X [] is already registered as the previous system state of the SST file 1200, that is, whether or not the examination has already been completed before that, and the SST file 120
If the previous system state of 0 is registered, the process returns to step S31. If it is not registered as the previous system state of the SST file 1200 in step S33, it is judged that the creation of the SST file 1200 is not completed yet, and the process returns to the process A of FIG.

As described above, according to this embodiment, it is possible to confirm all possible system states of the system, and it is possible to know whether the described specifications are defined as intended. It can be done efficiently.

Since the specifications can be evaluated at the stage of specification definition in the early stage of system development, the cost required for modifying the specifications and eventually for developing the software can be reduced.

[Effects of the Invention] As described above, according to the present invention, in a system including a plurality of processing elements, the possible states of each processing element, the transition order of the states, and other processing elements that are conditions for transition There is an effect that it is possible to create an operation state diagram in which transitions of system states can be grasped based on states or state transitions.

[Brief description of drawings]

FIG. 1 is a block diagram showing a schematic configuration of the system of the embodiment, FIG. 2 is a diagram showing states and their transitions, FIG. 3 is a diagram showing an output example of flags, and FIG. 4 is a state transition and flags. FIG. 5 is a diagram showing a relationship of triggers, FIG. 5 is a diagram showing an example of outputting a flag from the unit b to the unit a in FIG. 2, and FIG. 6 is a diagram showing a relation between the state of the flag and execution of transition. The figure shows the trigger output from the unit a to the unit b and the state of transition, FIG. 8 shows the relationship between the trigger state and the execution of transition, and FIGS. 9 (A) and (B) show a plurality of flags. FIG. 10 (A) and (B) are diagrams showing the combination of a plurality of triggers, FIG. 11 is a diagram showing the combination of a plurality of flags and triggers, and FIG. 12 is a plurality of flags and a plurality of triggers. And FIG. 13 is a flow chart showing a file making process in this embodiment. FIGS. 14 (A) and (B) are diagrams showing an example of specification definition in this embodiment, FIGS. 15 (A) to (C) are diagrams showing UST, SRT, and IST file examples, respectively, and FIG. 16 (A). ) (B) is a diagram showing an example of SST file data, FIG. 17 is a diagram showing a dynamic state in this embodiment, and FIGS. 18 (A) and (B) are diagrams showing a memory configuration example of a working memory. 19 is a flow chart showing the detailed operation of the process A, FIGS. 20 (A) and (B) are diagrams showing the memory state of the working memory after the process A is executed, and FIG. 20 (C) is an example of the contents of the SST file. FIG. 21 and FIG. 21 are flow charts showing details of treatment B. In the figure, 1 ... Control state, 2 ... Transition, 3 ... Flag, 4
...... Trigger 10 Input / output device 20 Working memory 100 Specification editing unit 110 Database 120
… System specification storage unit, 200 …… Code conversion unit, 300 ……
Next state candidate selection unit, 400 ... Transition state identification unit, 500 ... SS
T Completion identification section, 600 ... Dynamic state diagram creation section, 700 ...
Dynamic status diagram display, 1000 …… Specification chart, 1110 …… US
T (Unit Sequence Table) file, 1120 …… IST (Ini
tial State Table) File, 1130 …… SRT (System Re
straint table) file, 1200 ...... SST (System Seque
nce Table) File, 1300 ... Dynamic state diagram storage unit.

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁶ Identification number Internal reference number FI Technical display location G06F 17/50 9191-5H G06F 15/60 360 P B41J 3/00 M (56) References JP-A-60-178795 (JP, A) JP-A-61-49236 (JP, A) JP-A-62-208171 (JP, A) JP-A-63-167932 (JP, A)

Claims (1)

[Claims] 1. An element state storage means for storing a possible state and a transition order of the state for each processing element of a plurality of processing elements included in a system, and a transition for each state transition of each processing element. Transition condition storage means for storing a state or a state transition in another processing element which is a condition of, and a combination of the states of the respective processing elements as the system state of the system, and the initial state of the given system as the initial value. A current system state storage unit that updates and stores the current system state; a current system state stored in the current system state storage unit; and a possible state of each processing element stored in the element state storage unit; Candidate creating means for creating a candidate for the next system state based on the transition order of the states, and each candidate for the next system state created by the candidate creating means. In addition, the determination means for determining whether or not the current system state stored in the current system state storage means is transitionable, and the candidate for the next system state determined to be transitionable by the determination means is the state A system state storage means for storing together with a transition order; and a candidate for the next system state determined to be transitable by the determination means as a new current system state in the current system state storage means, and the candidate is also stored. Control means for controlling to repeat the creation of the next system state candidate by the creating means; and a state diagram creating means for creating an operation state diagram of the system based on the stored contents of the system state storing means. A motion prediction device characterized by the above.