JPH021054A - Data editing device - Google Patents

Abstract

PURPOSE:To efficiently make a system into a model by providing a tree structure type data editing device and a network structure type data editing device and managing tree structure data and network structure data in an integrated state. CONSTITUTION:When one node is to be newly added to the tree structure data, a tree structure data editing device 1 examines whether the IDm of the node to be newly added is different from the ID of another node existing in the tree structure data or not. When the node, the node ID of which is (m), already exists in the tree structure data, node adding processing is not executed. Next, a node (m) is added to the tree structure data so that the node (m) can be the younger brother of a node (d). As the result, the data are stored in a storing device 3. A data integrating device 7 receives the added node IDm and a node IDb, which is the parent of the node IDm, from a device 1, retrieves network structure data (b) from a storing device 4, and displays the data (b) on a display dvice 5. Next, the device 7 adds the node (m) to the data (b) and displays the data (b) on the display device 5.

Description

[Detailed Description of the Invention] [Industrial Application Field] When describing a system in basic system design work, the present invention describes the functional hierarchy of the system as tree-structured data with functions as nodes. , the child functions of each function of the system developed in the functional hierarchy are expressed as nodes, and the data flow between the child functions is expressed as arcs between the nodes. The present invention relates to a device that supports a method of modeling.

〔overview〕

The present invention is a means for editing tree-structured data and network-structured data, and by including a connector in the network-structured data, it is possible to semi-automatically generate one data into the other. It is something.

[Conventional technology]

Conventionally, devices that support system modeling include a tree-structured data editing device that describes the system's functional hierarchy as tree-structured data with functions as nodes, and a separate device that describes system functions as nodes. There is a network-structured data editing device that describes network-structured data in which data flows between functions are expressed as arcs between nodes.

[Problem that the invention seeks to solve]

However, with conventional tree-structured data editing devices that describe the functional hierarchy of a system, although it is possible to express the configuration of the system's functions, it is not possible to describe the data flow between functions, so it is difficult to model the system. As a support device, there were some aspects that were insufficient. On the other hand, when using a network-structured data editing device that describes network-structured data in which system functions are expressed as nodes and data flows between functions are expressed as arcs between nodes, system functions can be divided into several child functions. A system model can be described by dividing the system and describing the data flow between the child functions, starting from the upper level functions of the system. There is a problem in that it is difficult to understand all the functions of the system.

On the other hand, it is also possible to model a system by using the above-mentioned tree structure data editing device and network structure data editing device together, but in that case, since the two devices are independent, it is possible to model the system. The user had to manage the data stored in the system, which caused the following problems.

The user has to check whether the data are consistent with each other, the user has to make corrections one by one when the data is inconsistent, and the related data is updated in response to changes. The user must modify some data written on one device, and if the user wants to use it on the other device, the user must re-enter the same data.

The present invention eliminates such drawbacks, and includes both a tree-structured data editing device and a network-structured data editing device,
Another object of the present invention is to provide a data editing device that can efficiently model a system by managing tree-structured data and network-structured data in an integrated manner.

[Means for solving problems]

The present invention provides a first editing means for associating one of a plurality of data describing a system with a node and creating tree-structured data including an identifier of this node and a level of this data, and a first editing means for storing this tree-structured data. a first device having a first storage means for storing data; and a first device including, for each node of the tree-structured data created by the first editing means, an identifier of a child node of this node and an arc related to this child node. In a data editing device comprising a second editing means for creating network structure type data and a second device having a second storage means for storing the network structure type data, the second editing means Means for generating a new node representing an arc having this node as a starting point or ending point in the network structure data corresponding to the parent node of the node corresponding to this data, and providing this new node to the second storage means. including;
The present invention is characterized by comprising data integration means for making the contents of the first storage means correspond to the contents of the second storage means based on this new node.

[Effect]

When describing a system model using a tree-structured data editing device, it is possible to efficiently create tree-structured data that expresses the functional hierarchy of the system, and when describing a system model using a network-structured data editing device. This method efficiently creates network-structured data that expresses the data flow between the constituent functions of the system. On the other hand, a data integration management device manages tree-structured data and network-structured data, and checks the consistency between these data, semi-automatically generates one data from another, and performs other operations when modifying one data. Automatically correct data, etc. This allows system modeling without having to bother with manual consistency checks, data transcription, or data modification.

〔Example〕

An embodiment of the present invention will be described below with reference to FIGS. 1 to 43.

First, the structure of tree-structured data, the structure of network-structured data, and the relationship between these data, which are the targets of this embodiment, will be described using examples. In addition to a child node of a certain node in tree-structured data as a node that appears in network-structured data, the present invention sets that node as a start point or end point in network-structured data corresponding to the parent node of that node. It is characterized by the provision of nodes (hereinafter referred to as connectors) that express arcs.

FIG. 2 is an example of a display image of tree-structured data. Tree-structured data consists of nodes.

Each node has a unique node ID in the tree-structured data. A node whose node ID is "a" is called a node a. FIG. 3 is an example of tree-structured data stored in the tree-structured data storage device.

One line in the tree-structured data corresponds to one node. Each row has a level on the tree structure and a node ■D. The level of the root is "O", and the level of the child node is the number obtained by adding "1" to the level of the parent node.

FIG. 4 is an example of a display image of network structure type data. Network-structured data consists of nodes, connectors, and arcs. There are two types of connectors: in connectors and out connectors. Each node and connector has a node ID
and connector rD, and their IDs shall not be duplicated in one network structure type data. However, the existence of an in connector and an out connector with the same connector ID is allowed. A node whose node ID is "a" is called a node a, and a connector whose connector ID is "a" is called a connector a. Arcs have direction, indicated by arrows. One node or in-connector is determined as the starting point and one node or out-connector is determined as the ending point for the arc. An in-connector cannot be the end of an arc, nor can it be the start of more than one arc.

An out connector cannot be the start of an arc, nor can it be the end of more than one arc.

There are no arcs that connect connectors, and there are no arcs whose starting and ending points are the same 7-de.

The start and end nodes of different arcs do not coincide. An arc starting from node a or in connector a and ending at node b or out connector b is called arc ab. FIG. 5 is an example of network structure data stored in the network structure data storage device. Network structure type data has a network structure type data ID. The network structure data consists of two parts: a part in which data regarding nodes (including connectors) is described, and a part in which data regarding arcs is described. Node is node ID
, an identifier representing the node type Oi (node or connector), and node position information. Nodes are represented by the identifier N, in-connectors are represented by the identifier IN, and out-connectors are represented by the identifier OUT. The arc has the ID of the node that is the starting point and the ID of the node that is the ending point.
and the location information of the arc. Location information is omitted here.

Next, the relationship between tree structure type data and network structure type data will be explained. Each node in the tree structure data corresponds to at most one network structure data. However, leaf nodes in the tree-structured data do not have corresponding network-structured data. The ID of the network structure data corresponding to node a is raJ, and this network structure data is referred to as network structure data a.
It is called.

The set of nodes constituting the network-structured data a corresponds to the set of child nodes (grandchildren and below are not included) of the node a in the tree-structured data. When node a and node b are parent and child ("a" is the parent) in tree structure data, the following relationship exists between network structure data a and network structure data b.

(2) If there is an arc starting from node C (or inner connector C) and ending at node b in network structure data a, then inner connector C exists in network structure data b. (2) If there is an arc in network structure data a that starts at node b and ends at node C (or out connector C), out connector C exists in network structure data b. ■The connectors in the network structure data b are limited to the connectors described above.

FIG. 1 shows the configuration of an embodiment of the present invention. This embodiment includes a tree-structured data editing device 1 for creating and editing tree-structured data, and a tree-structured data display device 2 for displaying tree-structured data to be edited by the tree-structured data editing device 1. and,
A tree-structured data storage device 3 that stores the tree-structured data created by the tree-structured data editing device 1, and a network corresponding to the nodes in the tree-structured data specified by the tree-structured data editing device 1. A network structure data editing device 4 that creates and edits structured data; a network structure data display device 5 that displays network structure data to be edited by the network structure data editing device 40; and a network structure data display device 5 that performs network structure data editing. A network-structured data storage device 6 stores the network-structured data created by the device 4, and the tree-structured data stored in the tree-structured data storage device 3 and the data stored in the network-structured data storage device 6. and a data integrated management device 7 that integrally manages the network structure type data. In other words, this embodiment uses a tree structure type which is a first editing means for associating one of a plurality of data describing a system with a node and creating tree structure type data including the identifier of this node and the level of this data. A first device having a data editing device 1 and a tree-structured data storage device 3 which is a first storage means for storing this tree-structured data, and each node of the tree-structured data created by the first editing means. corresponding to the identifier of the child node of this node, the arc related to this child node, and the start or end point of this node in the network structure type data corresponding to the parent node of the node corresponding to this data for each network structure data. A network structure data editing device 4 which is a second editing means for creating network structure data including a new node representing an arc represented by a new node, and a network structure data editing device 4 which is a second storage means for storing this network structure data. It is provided with a second device having a data storage device 6, and a data integration management device 7 which is a data integration device that matches the contents of the first storage device and the second storage device based on this new node.

Next, the operation of this embodiment will be explained.

First, as a process for adding one new node to tree-structured data, a case will be described in which a node m is added as the node d of the tree-structured data shown in FIG.

The tree-structured data editing device 1 checks whether the IDm of the newly added node is different from the ID of any node existing in the tree-structured data. If a node with node ID m already exists, no node addition processing is performed.

Next, node m is added to the tree-structured data so that it becomes the node d's node. As a result, the data shown in FIG. 6 is stored in the tree-structured data storage device 3. This data is displayed using the tree-structured data display bag @2.
As shown in the figure. The data integration management device 7 receives the node IDm of the added node and the node IDb of its parent node from the tree structure data editing device 1, and searches the network structure data storage device 6 for network structure data b. FIG. 8 shows an example of the network structure data b, and FIG. 9 shows a display of the network structure data b using the network structure data display device 5. Next, the data integration management device 7 adds the node m to the network structure data b. The position where node m is added is automatically determined to be an appropriate position. An example of the network structure data b stored in the network structure data storage device 6 in this process is shown in FIG. 10, and FIG. 11 shows the data displayed using the network structure data display device 5.

Next, add 1 node registered in the tree structure type data.
As a process for deleting node b, a case will be described in which node b of the tree-structured data shown in the example display image of FIG. 2 is deleted. The tree-structured data bridge collection device 1 removes node b from the tree-structured data, and moves node C and node d, which are child nodes of node b, to the level of node b.

As a result, the data shown in FIG. 12 is stored in the tree-structured data storage device 3. FIG. 13 shows this data displayed using the tree-structured data display device 2.

The data integration management device 7 receives the node IDb of the deleted node and the node IDa of its parent node from the tree structure data editing device 1, and receives the network structure data a and the network structure data from the network structure data storage device 6. Search b. Fifth
The figure shows an example of network structure data a, and FIG. 8 shows an example of network structure data b.
4 and 9 respectively. Next, the data integrated management device 7 stores the network structure type data a.
Embed the network structure type data b into. At this time, all connectors of the network structure data b are removed, and arcs connected to them are connected to nodes or connectors in the network structure data a corresponding to each connector.

Next, the data integration management device 7 searches for nodes in the network structure data a that are connected to the node b by an arc. In this example, they are node e and node 1. Next, search network structure data b, connect connector e and connector i
are connected to node C and node d, respectively. Example of network structure data e and network structure data l
Examples are shown in FIGS. 14 and 16, respectively, and
Their display using the network structure type data display device 5 is shown in FIG. 15 and FIG. 17, respectively. The data integration management device 7 is the I of the connector b in the network structure data e.
D is recursively changed to "C", and the ID of connector b of network structure data i is recursively changed to "d". here,
The ID of connector b in network structure data e is changed recursively to the ID of connector in network structure data.
This will be explained using an example of recursively changing ``C'' to ``C''. First, the network structure data e is searched from the network structure data storage device 6, and the ID of the connector b therein is changed to "C".

Next, the network structure data e is searched for the node connected to the connector b by an arc. In this example, it is only node f. Next, the network structure data storage device 6 is searched for the ID11 structure data f, and the ID of the connector b therein is changed to "c".

This operation is repeated recursively until there are no nodes connected to connector b through arcs or there are no network structure data corresponding to the nodes.

In this example, the network structure type arc f does not exist, so the process ends there.

Finally, the network structure type data b is deleted from the network structure type data storage device 6. Network structure data aS network structure data e stored in the network structure data storage device 6 through this process
Examples of network structure data 1 are shown in FIGS. 18 and 2, respectively.
0 and 22, and their displays using the network structure type data display device 5 are shown in FIGS. 19, 21, and 23, respectively.

Next, as a process for deleting a subtree whose root is a certain node from tree-structured data, we delete a subtree whose root is node b from tree-structured data shown in the example display image in Figure 2. Explain when to delete. The tree-structured data editing device 1 removes the subtree whose root is node b from the tree-structured data. As a result, the data shown in FIG. 24 is stored in the tree-structured data storage device 3. FIG. 25 shows this data displayed using the tree-structured data display device 2.

The data integration management device 7 receives the node IDb of the deleted node and the node IDa of its parent node from the tree structure data editing device 1, and retrieves the network structure data a from the network structure data storage device 6. FIG. 5 shows an example of the network structure type data a, and FIG. 4 shows the display of the network structure data display device 5.

Next, the data integration management device 7 deletes the node b and all arcs connected to the node b from the network structure data a. Then, among the 7-does in the network structure data a, a node connected to node b by an arc is searched. In this example, they are node e and node l. Then, the connector b is recursively deleted from the network structure data e and the network structure data l.

Here, recursively deleting a connector from network structure data will be explained using an example of recursively deleting connector b from network structure data e. First, the network structure data e is retrieved from the network structure data storage device 6, and the connector b therein and all arcs connected to the connector b are deleted. Next, a search is made for the node connected to the connector b through the arc in the network structure arc e. In this example, it is only node f. Next, the network structure data f is searched from the network structure data storage device 6, and the connector b therein and all the arcs connected to the connector b are deleted. This operation is repeated recursively until there are no more nodes connected to connector b by arcs or there is no more network structure data corresponding to the nodes. In this example, since the network structure type data f does not exist, the process ends there.

All the network structure data b and the network structure data corresponding to the child nodes and grandchild nodes of node b are deleted from the network structure data storage device 6.

Examples of network structure data a, network structure data e, and network structure data i stored in the network structure data storage device 6 in this process are shown in FIGS. 26, 28, and 30, respectively. are shown in FIGS. 27, 29, and 31, respectively, using the network structure data display device 5.

Continuing, as a process for adding one new node to the network structure data, a case will be described in which a node m is added to the network structure data b shown in the example display image of FIG. 9. The network structure type data editing device 4 determines the ID of the node in which network structure type data the IDm of the newly added node exists.
Find out what is different from D. If a node with the node ID "m" already exists, the node addition process is not performed. Next, node m is added to network structure data b. As a result, the data shown in FIG. 10 is stored in the network structure data storage device 6 as a network structure arc b. FIG. 11 shows this data displayed using the network structure type data display device 5. The data integration management device 7 receives the node IDm of the added node and the node IDb of its parent node from the network-structured data editing device 4, and
Add node m to tree-structured data. At this time, node m becomes a child of node b, but the position at which node m is added is automatically determined to be an appropriate position. FIG. 6 shows an example of the tree-structured data stored in the tree-structured data storage device 3 through this process, and FIG. 7 shows the tree-structured data displayed using the tree-structured data display device 2.

Next, as a process for deleting a certain node from network structure data, a case will be described in which a node is deleted from network structure data a shown in the example display image of FIG. 4. The network structure data editing device 4 removes node b from the network structure data a. The data integrated management device 7 uses the node IDb of the node deleted from the network-structured data editing device 4.
and the node IDa of its parent node. Then, the network structure data a is retrieved from the network structure data storage device 6, and all arcs connected to the node b are deleted. Then, among the nodes in the network structure data a, the node connected to the node b by an arc is searched. In this example, they are node e and node 1. Then, the connector b is recursively deleted from the network structure data e and the network structure data l. Further, among the network structure data stored in the network structure data storage device 6, all the network structure data b and the network structure data corresponding to the child nodes and grandchild nodes of the node are deleted. Through this processing, examples of network structure data a1, network structure data e, and network structure data i stored in the network structure data storage device 6 are
6, 28, and 30, and their display using the network structure type data display device 5 is shown in FIG. 27, respectively.
29 and 31. Next, the data integrated management device 7 deletes the subtree with node b as the root from the tree-structured data. FIG. 24 shows an example of the tree-structured data stored in the tree-structured data storage device 3 through this process, and FIG. 25 shows the tree-structured data displayed using the tree-structured data display device 2.

Next, as a process for adding a new arc to the network structure data, a case will be described in which the network structure data flow chart ib shown in the example display image of FIG. 4 is added. The network structure data editing device 6 checks whether the newly added arc is suitable for describing network structure data. If it is inappropriate, arc addition processing will not be performed. Next, arc ib
is added to the network structure type data a. As a result, the data shown in FIG. 32 is stored in the network structure data storage device 6 as a network structure arc a. FIG. 33 shows this data displayed using the network structure type data display device 5. The data integration management device 7 uses the starting point rlDi of the arc added from the network-structured data editing device 4 and the ending point rl
DbJ is received, and network structure data 1 and network structure data b are retrieved from the network structure data storage device 6. 16th
8 and 8 respectively show examples of network structure data i and network structure data b, which are displayed on the network structure data display device 5.
Figures 17 and 9 respectively show what is displayed using . Next, the data integration management device 7 adds an out connector b to the network structure data l, and adds an in connector 1 to the network structure data b. The position where the connector is added is automatically determined to be an appropriate position. Examples of network structure data 1 and network structure data b stored in the network structure data storage device 6 through this process are shown in FIGS. 34 and 36, respectively, and are displayed in the network structure data display device 5.
What is displayed using is shown in FIG. 35 and FIG. 37.

As a process for deleting an arc from the network structure data, a case will be described in which an arc bi is deleted from the network structure data a shown in the example display image of FIG. The network structure data editing device 4 removes the arc b1 from the network structure data a. The data integration management device 7 stores the starting point r of the arc deleted from the network-structured data editing device 4.
IDbJ and the end point rlDi. Then, the network structure data storage device 6 is searched for the network structure data b and the network structure data l, the out connector l is recursively deleted from the network structure data b, and the in connector is searched from the network structure data 1. Delete b recursively. Examples of network structure data a1, network structure data b, and network structure data l stored in the network structure data storage device 6 through this process are shown in FIGS. 38, 40, and 42, respectively. 39, 41, and 43 respectively show what is displayed using the network structure type data display device 5.

〔Effect of the invention〕

As explained above, the present invention expresses the functional hierarchy of a system as tree-structured data, and each function of the system is represented by network-structured data composed of sub-functions and data flows between the sub-functions. When modeling a system by detailing it using representations,
Tree-structured data and network-structured data are managed by a data integration management device, and the consistency between these data is checked, semi-automatic generation of one data from the other data, and modification of one data is performed on the other data. Since automatic correction is performed, it has the effect of allowing you to proceed with your work more efficiently.

[Brief explanation of the drawing]

FIG. 1 is a block configuration diagram showing the configuration of an embodiment of the present invention. Figure 2 is an example of a display image of tree-structured data. FIG. 3 is an example of tree-structured data stored in a tree-structured data storage device. FIG. 4 is an example of a display image of network structure data a. FIG. 5 is an example of network structure data a stored in a network structure data storage device. FIG. 6 shows tree-structured data that is stored in the tree-structured data storage device when a node m is added to the tree-structured data shown in FIG. FIG. 7 is an image diagram when the contents of FIG. 6 are displayed on a tree-structured data display device. FIG. 8 is an example of network structure data b stored in the network structure data storage device. FIG. 9 is an image diagram when the contents of FIG. 8 are displayed on a network structure type data display device. FIG. 10 shows network structure data b0 stored in the network structure data storage device when node m is added to network structure data b in FIG. 8. FIG. 11 shows the contents of FIG. An image diagram when displayed on a display device. FIG. 12 shows tree-structured data stored in the tree-structured data storage device when node b is deleted from the tree-structured data of FIG. FIG. 13 is an image diagram when the contents of FIG. 12 are displayed on a tree-structured data display device. FIG. 14 is an example of network structure data e stored in the network structure data storage device. FIG. 15 is an image diagram when the contents of FIG. 14 are displayed on a network structure data display device. FIG. 16 is an example of network structure data i stored in a network structure data storage device. FIG. 17 is an image diagram when the contents of FIG. 16 are displayed on a network structure data display device. Figure 18 shows network-structured data a0 that is stored in the network-structured data storage device when node b is deleted from the tree-structured data in Figure 3. Figure 19 shows the contents of Figure 18 as network-structured data. An image diagram when displayed on a device. FIG. 20 shows a! which is stored in the network-structured data storage device when node b is deleted from the tree-structured data shown in FIG. I
Structure Structure Type Data FIG. 01 is an image diagram when the contents of FIG. 20 are displayed on a network structure type data display device. Fig. 22 shows WJ structure data j0 stored in the network data storage device when node b is deleted from the tree structure data in Fig. 3. Fig. 23 shows the contents of Fig. 22 as network structure data. An image diagram when displayed on a device. FIG. 24 shows tree-structured data stored in the tree-structured data storage device when the subtree with node b as the root is deleted from the tree-structured data of FIG. FIG. 25 is an image diagram when the contents of FIG. 24 are displayed on a tree-structured data display device. Figure 26 shows the network structure data stored in the network structure data storage device when the subtree with node b as the root is deleted from the tree structure data in Figure 3. An image diagram when displayed on a structured data display device. Figure 28 shows network-structured data that is stored in the network-structured data storage device when the subtree with node b as the root is deleted from the tree-structured data in Figure 3. An image diagram when displayed on a structured data display device. FIG. 30 shows network structure data l stored in the network structure data storage device when the subtree with 7-do b as the root is deleted from the tree structure data of FIG. FIG. 31 is an image diagram when the contents of FIG. 30 are displayed on a network structure data display device. FIG. 32 shows network structure data a0 stored in the network structure data storage device when arc ib is added to network structure data a in FIG. 5. FIG. 33 shows the contents of FIG. 32 as network structure data. An image diagram when displayed on a display device. Figure 34 shows network structure data 10 that is stored in the wj structure data storage device when arc ib is added to network structure data a in Figure 5. Figure 35 shows the contents of Figure 34 as network structure data. An image diagram when displayed on a display device. FIG. 36 shows network structure data b0 stored in the network structure data storage device when arc ib is added to network structure data a in FIG. 5. FIG. 37 shows the contents of FIG. 36 as network structure data. An image diagram when displayed on a display device. Figure 38 shows network structure data a0 stored in the network structure data storage device when arc bi is deleted from network structure data a in Figure 5. Figure 39 shows the contents of Figure 38 as network structure data. An image diagram when displayed on a display device. FIG. 40 shows network structure data b0 stored in the network structure data storage device when arc bi is deleted from network structure data a in FIG. 5. FIG. 41 shows the contents of FIG. 40 as network structure data. An image diagram when displayed on a display device. Figure 42 shows network structure data 1 stored in the network structure data storage device when arc bl is deleted from network structure data a in Figure 5. Figure 43 shows the contents of Figure 42 in network structure type An image diagram when displayed on a data display device. DESCRIPTION OF SYMBOLS 1...Tree structure type data editing device, 2...Tree structure type data display device, 3...Tree structure type data storage device, 4.
... Network structure type data editing device, 5... Network structure type data display device, 6... Network structure type data storage device, 7...
Data integration management device. Patent applicant: 8hon Denki Co., Ltd., agent: Naoki Ide, patent attorney Display image of structured data Figure 2 Display image of network structure data a Figure 4 Structure of network structure data a Figure 5 Network Structure of structure type data b Fig. 8 Fig. Display image of network structure type data b Fig. Structure of network structure type data b to which node m has been added Fig. 10 Fig. 10 Diagram of network structure type data to which node m has been added Display image Fig. 11 Structure of network structure data e Fig. 14 Display image of network structure data e Fig. Display image of network structure data i Fig. 16 Structure of network structure data i Fig. 16 Node b has been deleted Figure 18: Display image of network structure data from which node b has been deleted Figure 19: Display image of network structure data e from which node b has been deleted Figure 18: Network structure from which node b has been deleted Structure of type data e Fig. 20 Network structure type data with node b deleted Fig. 22 Display image of network structure data i with node b deleted Fig. Network structure type data aI7) tI4 formation 32nd with arc b added
Figure 33 Display image of data a Figure 34 Structure of network structure data j to which arc ib has been added
Configuration No. 36 of network structure data b to which figure data ib has been added
Display image of figure data b Figure Figure Figure Configuration of network structure data a from which arc bi has been deleted Figure Figure Figure Configuration of network structure data i from which arc bi has been deleted 42
figure

Claims (1)

[Claims] 1. A first editing means (1) for associating one of a plurality of data describing a system with a node and creating tree-structured data including an identifier of this node and a level of this data; A first device having a first storage means (3) for storing this tree-structured data, and an identifier of a child node of this node corresponding to each node of the tree-structured data created by the first editing means. data comprising: a second editing means (4) for creating network structure data including arcs related to child nodes; and a second device having a second storage means (6) for storing the network structure data. In the editing device, the second editing means (4) is configured to create, for each network structure data, a new arc that expresses an arc having this node as a starting point or end point in the network structure data corresponding to the parent node of the node corresponding to this data. data integration means for making the contents of the first storage means correspond to the contents of the second storage means based on the new node; (
7) A data editing device comprising: