JPS62262144A - Graphical language processing system - Google Patents

Abstract

PURPOSE:To specify a subsystem and the whole system of integrated subsystems by using a converting and processing system of graphical hierarchical structure description which uses a graphical data driving type language as an intermediate language. CONSTITUTION:Graphical structure description 100 is inputted to a graphic terminal 10 by a graphic editor 20 and converted to a graphical data driving type language D<3>L program 200. The D<3>L 200 has the functions of simulation and validation of a program described by itself. Accordingly, justness of the description 100 can be confirmed on a terminal 10 through a transformer 30 and an editor 20 by using the verification of D<3>L 200. Completed description 100 is converted to execution form 300 through a compiler corresponding to a process execution hardware 40 to make analyzing and valuation of objective problem or system operation as D<3>L 200, and processed on a hardware 40.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention is extremely effective for system design of real-time processing systems such as switching control, and particularly for defining specifications from required functions. It relates to a graphical language processing method based on the concept of state transition that enables top-down glototyping of specifications.

[Conventional technology]

Many systems have the characteristic of performing some kind of transformation on input data within the system to generate output data. Conventionally, systems have been modeled by focusing on the flow of such data. Requirement specifications at the functional level have been described using description methods that take into account the structure of the system, such as flow models and graph models.

On the other hand, in real-time processing systems such as exchange control, the system functions are layered, and the cause-and-effect relationship of input and output is determined for each layer.
Functions or specifications were defined using a graphical description method using a hierarchical state transition diagram as shown in Figure 2, modeled using the concept of state transition.

[Problem that the invention seeks to solve]

As mentioned above, the initial stage of system design generally involves trial-and-error work to embody the functions required for the system as specifications, but in the process, the structure of the system itself to be developed is completely determined from the beginning. Specification description methods, which require careful consideration, are often constrained by the method of realizing the structure, etc., and tend to restrict the user's free thinking, and cannot be said to be truly easy for manufacturers to use. It's not a thing. Also, the floor,
Even if you use the method of decomposing the functions in a simple manner, it is difficult to verify the operational functions of the system just by describing the state transition diagram shown in Figure 2, and in general, it is difficult to verify the operational functions of the system. In other words, it is necessary to translate the graphical description into a text type description. In this case, since a text-type description that is dependent on the sequential processing computer architecture is usually forced, restrictions are placed on the original internal description expression format or description ability, or processing efficiency for diagrams and graphical expressions is limited. There is a strong tendency for the value to decrease dramatically, and in the end, the characteristics of verbal function description methods such as state transition diagrams are not utilized.

Therefore, the main purpose of this invention is to provide a language system and processing system that does not require any knowledge of the current computer architecture and is logically consistent from the description method to the processing system. It's about doing. To take a specific example, the objective is to provide a processing system that allows the required functions of the system to be specified by simply writing the hierarchical state transition diagram itself as shown in FIG.

[Means for solving problems]

In order to efficiently process the expression of required functions by verbal description without adding any constraints, we have developed a verbal data-driven language (Diagrammatical Data-Driven Language).
By introducing a conversion system (7/sforma) that uses nLanguage: D3L as an intermediate language, it can be executed on any computer that can process D3L.

(For the language specifications of oral intermediate language D3L, please refer to
Journal of the Institute of Electronics and Communication Engineers (D), J66-D, IO.

P, 1169-+176 (Sho 58-10)) [Operation] By using the conversion system of the pronation request function description to D3L according to the present invention, the parallelism explicitly and naturally described can be Not only is it preserved in its original form at the linguistic level, but also the functional operation of the system based on oral descriptions can be verified using the verifiability based on D3L's language rules. Also, the additivity in the pronation specification description, that is,
Synthesis and decomposition of specifications is guaranteed even at the D3L level, enabling top-down prototyping in system specification definition.

〔Example〕

FIG. 1 shows a diagrammatic hierarchical structure description D3 based on the present invention.
An example of a colloquial language processing system that converts into an L program and executes it will be shown. Referring to Figure 1, description of the park structure +0
0 is converted to D3L200, and then the executable format aOO
We will explain the process of conversion into . The park structure description +00 is
Graphics terminal (input/output and display device) by the graphic editor 20! 0 and is converted into the D3L program 200 via the transformer 30. Since the D3L200 has a program simulation and validation function written by itself, the validity of the park structure description +00 can be verified on the graphic terminal 1 via the transformer 30 and the graphic editor 20 using the verifiability of the D3L200. ' 0
You can check it above.

At this stage, for example, the validity of the component diagram and the validity of the connections between these element sections are verified according to the rules related to the structure description of the park. Part of the analysis check can be performed. As mentioned above, the park structure description +00 completed after descriptive verification is based on the D3L program 200.
In order to analyze and evaluate the target problem or system operation, it is converted into an executable format 30o via a compiler suitable for the processing execution hardware 4o, and processed on the hardware 40.

The process of generating a hierarchical state transition diagram as shown in FIG. 2, which has conventionally been widely used as a graphical hierarchical structure description 100, by the graphic editor 20 and processing it will be explained. First, in FIG. 2 110, two shapes 9
Four types of transitions taa + tbb for Sa and Sb
+tab+tba exists, and represents a function that holds states sa and sb in response to an external input, and a function that transitions between the two states from Sa to sb and from sb to Sa.

Figure 2 +20/li, the transition tab is a transition between the three states sa', sb', and Sc' one level lower.
C+ ic'c' r tc'b'+ and ta'b'
indicates that it is a nested transition summarizing, and on the other hand,
+30Fi, state sb is one level lower than four states Sb
++ Sbz, Sb3. Sb4 and the transition between them tbIb2. This indicates a nested state that summarizes tb+b3, etc. In the following description, for the sake of simplicity, it is assumed that state sb does not have a hierarchical structure, that is, there is no nested state 130, and only nested transition +20 is considered. FIG. 3 shows an example in which the hierarchical state transition diagrams 110 and 120 are converted into D3L programs 21, 2!2, and 220 by the transformer 7ohm 30.

The details of the language specifications of D3L are publicly known, so referring to the above-mentioned literature, the state transition diagram 110 of the upper layer is
The program is converted into a procedure 211 that describes the state transition of the first layer and a procedure 212 that describes the two states belonging to the layer. In addition, procedure 2 is created as a lower layer state transition diagram + 20H1D3L program.
Converted to 2G.

For each procedure 211, 212, and 220, D
State transition diagram based on 3L execution rules! 10 and 12Q
I will explain in detail the correspondence. Procedure 21! When a - set of input variables is given to the source part IN of
Either the corresponding procedure 212 or the procedure 220 representing a transition one level lower is selected.

If Sa of procedure 212 is selected, then
Depending on the input change, the selector CASEa selects either the primitive holding the state Sa or the procedure 220 representing a transition one level lower. Here, if procedure 220 is selected, the state promised in the past is set as the next final state to which the currently focused starting state Sa should transition, and the database S
Referring to TAT 2, the selector CASEK selects either the procedure representing the state Sa or the procedure representing the state s b/ according to the promised state identifier. Assuming that state s b/ is selected, procedure s b/ sends the - set of outputs to the sink OUT, updates the database 5TAT2 according to the exhaustion of transitions in the lower hierarchy, and then The state sb to be focused on is referred to from the database STD 2, and its identifier is sent to the sink NEXT.

In the execution so far, among the transitions from the state Sa in the state transition diagram 110, the transition ta'b' from the state Sa' to Sb2 based on the state transition diagram 120 has been specified. When the procedure 220 ends, the start state sb to be focused on next is output to the sink 5TATE in the procedure 212, and the data sent to the sink OUT of the procedure 220 is output to the sink OUT. Upon completion of , the start state sb to be focused on next is updated to the database 5TATE and sent to the sink NEXT.On the other hand, the function output from the transition ta b is sent to the tank OUT of procedure 21. be done.

By the way, the state transition diagram 110 and +2 having a hierarchical structure
When 0 is written in the fully expanded form to one level, it becomes an isochratal expression such as +30. On the other hand, the D3L programs 211, 212, and 220 expressed in a hierarchical structure are expressed as procedures 231 and 232 as expanded forms into one layer. Therefore, from the state transition diagram 130, by using the conversion method itself in the hierarchical description, D
This means that the 3L programs 231 and 23.2 can be generated.

These characteristics of the transformer 7ohma 30 according to the present invention are:
From a different perspective, a state transition diagram 130 as shown in FIG.
However, the 3L program 230 as shown in FIG. 5 is nothing but a composite of the decomposed state transition diagrams 131 to +33.
In view of the fact that it can be obtained by synthesizing and decomposing it and vice versa, it has been proven that additions and deletions in a state transition diagram representation as shown in FIG. 6 can be directly supported. 6th
In the figure, 140 and 150 are state transition diagrams, and 241°2
42, 251.252 shows a program using an oral data-driven language.〇 [Effects of the invention] As mentioned above, by using a conversion/processing system for internal hierarchical structure description using D3L as an intermediate language, the system can be In design, the specification of subsystems and the specification of the entire system that integrates those subsystems can be executed extremely efficiently using a procedure that closely resembles the human thought process, in other words, it is possible to perform top-down prototyping of required functions or specifications. become. Furthermore, since the conversion of a D3L program into an executable format can be selected depending on the hardware to be executed, it can be applied to a wide range of system designs.

[Brief explanation of drawings]

FIG. 1 is a diagram showing an embodiment of an oral language processing system according to the present invention. FIG. 2 is a diagram showing a hierarchical state transition diagram notation. FIG. 3 is a diagram showing an example of conversion of the state transition diagram notation according to the present invention into a program using an oral data-driven language. FIG. 4 is a diagram showing a specific example of synthesis/decomposition of state transition diagrams. FIG. 5 is a diagram showing a specific example of composition and decomposition of an intraoral data-driven program. FIG. 6 is a diagram showing a specific example of deletion and addition conversion in the state transition diagram notation according to the present invention. In the figure, lO is an input/output and display device, 20 is a graphic editor, 30 is a transformer 7ohm, 40/fi
Processing execution hardware, 110.120°130.13
1,132,133,140,150 are state transitions
'Figure, 200.211.212.220.230.2
31.232°233, 241.242.251.25
2 is a program based on oral data-driven language, +00
H-diagrammatic hierarchical structure description 300 indicates an execution format.

Claims (1)

[Claims] 1. Display means and input/output means capable of graphically describing a hierarchical structure, translating the graphical hierarchical structure description into a graphical data-driven language, and converting it into a program in the graphical data-driven language. A graphical language processing method characterized by comprising means for.