EP1116143A1

EP1116143A1 - Method for determining a graphic structure of a technical system and set and configurations for determining a graph structure

Info

Publication number: EP1116143A1
Application number: EP99953666A
Authority: EP
Inventors: Erwin Thurner
Original assignee: Siemens AG
Current assignee: Siemens AG
Priority date: 1998-09-02
Filing date: 1999-09-01
Publication date: 2001-07-18
Also published as: WO2000014661A1

Abstract

According to the invention, graph structure data is selected from a plurality of several different graph structure data. Each graph structure data contains the elements that may be selected for its representation in order to graphically describe the structure of the technical system. The elements are selected in such a way that the technical system can be described using the selected elements. The elements are represented by an editor program in which the selected graph structure data has being integrated.

Description

description

Method for determining a graphical structure of a technical system and arrangement, and set of arrangements for determining a graphene structure

It is known to describe various technical systems using a graphic structure.

From [1], must be determined for such a technical system, an elec tronic circuit ^¬ known, the electrical circuit in the form of a graphic structure with elements that describe an electronic circuit.

Elements of a graphene structure in the context of a circuit simulation are symbols which symbolize electronic components, for example a resistor, a capacitor, an inductance, a transistor, an operational amplifier or other electronic components composed of these elements.

In the method known from [1] and the arrangement known from [1], elements provided to a user by a editor program are selected for the graphic description of an electronic circuit in such a way that the technical system "electronic circuit" is used with the selected elements "is described. The elements are represented by the editor program.

A graph structure describes a graph G (= V, E, Ψ), which has a finite, not empty set V (v e V denote nodes of graph G) and a finite set E (e e E denote edges of graph G). The nodes and edges of the graph are linked by an incidence function Ψ, which is formed according to the following rule:

Ψ: E → {{i, j} | i, jev} (1) Each edge e of the set E of edges is assigned its two end points by the incidence function Ψ (e).

Depending on the field of application, different types of nodes and edges can be provided in an editor program for describing a technical system. In general, nodes and edges in an editor program to which application-dependent semantics are assigned are referred to as elements of the graph.

A node element of a graph is, for example, a symbol in the editor program from [1], which symbolizes an electronic component of the electronic circuit. The edges can be used to describe weighted connections between the individual elements.

In general, the respective nodes and edges can be assigned a weight, a value specification or any text for information (textual information).

An editor program for determining a Petri network is known from [2]. A Petri network is preferably used for the analysis and for the design of a regulation or a control of a technical system, generally for describing a system behavior of a technical system. A graph, which is shown in the form of a Petri network, has a point S or a transition T as elements. A general overview of a Petri net and its basic elements can be found in [3].

A Petri net is generally a triple

N: = <S, T, F> with (i) S = {sl, s2, ..., sn} set of digits (ii) T = {tl, t2, ..., t} set of transitions (iii) S n T = 0 S and T disjoint (the

Knot set consists of S and T) (iv) F ςz (SxT) s (TxS) river relation

A disadvantage of the known methods and arrangements is in particular that, depending on the application, only elements of a graph intended for a specific application are provided for determining the graphic structure of a technical system. Thus, with the editor program from [1], only a selection can be made from elements for describing an electronic circuit, and with the editor program from [2], only a selection from elements to describe a Petri network.

Such a known editor program is therefore extremely inflexible in the event that a user wishes to use different types of graphic structure to describe a technical system. A separate editor program adapted to the application must then be developed for each special application, which leads to considerable development costs.

The invention is therefore based on the problem of specifying a method for determining a graphic structure of a technical system and an arrangement and a set of several arrangements for determining a graph structure, which has improved flexibility compared to the known methods and arrangements.

The problem is solved by the method, the arrangement and the set of arrangements according to the features of the independent claims. A method for determining a graphical structure of a technical system has the following steps: a) a graph structure file is selected from a set of several different graph structure files, each being specified in a graph structure file, which elements can be selected for their representation in order to graphically describe the technical system in its structure, b) elements are selected in such a way that a technical system is described with the selected elements, and c) the elements are Program shown in which the selected graph structure file has been integrated, which determines the graphic structure of the technical system.

An arrangement for determining a graph structure has the following features: a) a memory in which a number of different graph structure files are stored, a graph structure file specifying which elements are selected for their representation can be used to form a graph, b) a selection unit with which a graph structure file can be selected from the set of graph structure files, c) a processor which is set up such that an editor -Program is executable with which editor program can be determined using a graph structure file selected from the set of graph structure files, a graph with elements of the selected graph structure file, whereby the graph structure is determined , and d) a display component coupled to the editor program, with which the specific graph structure can be displayed.

A set of several arrangements for determining a graph structure has: a) a first arrangement which has a memory in which a number of several different graph structure files are stored, a graph structure file specifying which elements can be selected to represent them by one To form graphs, and b) a second arrangement coupled to the first arrangement and having the following components:

a selection unit with which a graph structure file can be selected from the set of graph structure files,

- an editor program with which using from the

Set of graph structure files selected graph structure file a graph can be determined with elements of the selected graph structure file, which determines the graph structure,

- A display component coupled with the editor program, with which the specific graph structure can be displayed.

The invention provides a method which is very flexible compared to the known methods and arrangements and a very flexible arrangement for determining a graphic structure which can be quickly and easily adapted to new application scenarios or to existing application scenarios.

In this way, different types of structures, which can be represented as a graph, can be processed in a flexible, cost-effective and simple manner with a method or with an arrangement.

Preferred developments of the invention result from the dependent claims.

The technical system is preferably an electronic circuit or a technical system. The elements are preferably graph elements of a graph that describe the technical system.

In a further embodiment, it is provided that the specific graphic structure of the technical system is checked for predetermined structure rules. In this way it is possible to check a structure of the technical system determined by a user for predetermined structure rules, thereby ensuring that the structural rules for the respective technical system are adhered to in its graphic structure.

Such a structural rule can be seen in a Petri network, for example, in that there is always one transition

Body must follow and vice versa. If this is not the case, then as part of this further development, when checking the graphic structure of a Petri network, it is reported that the corresponding structure rule has been violated.

An embodiment of the invention is shown in the figures and is explained in more detail below.

Show it

Figure 1 is a sketch of an arrangement according to a first embodiment;

FIG. 2 shows a sketch of a display component with a graphic structure with elements of a petri

Network;

FIG. 3 shows a sketch of a display component with a graphic structure with elements that describe an electronic circuit; FIG. 4 shows a flow chart in which the method steps of the method according to an exemplary embodiment are shown;

FIG. 5 shows a set of several arrangements which, according to a second exemplary embodiment, are coupled to one another via a communication network.

1 shows an arrangement 100 with a set 101 of several different graphic structure files 102, 103, 104,

105. Each graphic structure file 102, 103, 104, 105 is designed as a dynamically linkable file (dynamic link library).

A graphic structure file 102, 103, 104, 105 is selected by a user 106 via a selection component 108 (keyboard and / or computer mouse) connected to an editor program 107.

The selected graphic structure file, in this exemplary embodiment a first graphic structure file 103, is dynamically integrated into the editor program 107.

After integration into the editor program 107, the user 106 on a screen 110 has a set 111 of selectable elements 112, 113, 114, which are specified in the first graphic structure file 103, via a display component 109 connected to the editor program 107 are shown as selectable elements for determining another graph described. Furthermore, in this exemplary embodiment, according to the first graphic structure file 103, a first check program 115 and a second check program 116 are integrated in the editor program 107 and are made available to the user 106 for selection.

Each graphic structure file 102, 103, 104, 105 each has a number of selectable elements for the respective type of graph, each with a graphic structure file provided. see is for a kind of a graph. Furthermore, each graphic structure file 102, 103, 104, 105 can each contain a special check program which is integrated with the respective graphic structure file 102, 103, 104, 105.

After incorporation of the first graphic structure file 103, elements of the graph are selected by the user 106 and connected to one another, so that a graph is determined which is stored in a memory 118 in the form of a predetermined intermediate language 117.

It is also shown symbolically in FIG. 1 that the user 106 has stored several structures 119, 120, 121, 122, 123 for describing different graphs for the type of graph specified by the first graphics file 103.

The first graphic structure file 103 provides elements which enable a graph in the form of a Petri network 201 (see FIG. 2).

2 shows the display component 200, which is shown to the user 106 in the form of a screen surface.

The screen surface 200 has a menu bar 202 with different selectable options ("File", "Edit", "Object", "View", "Tools", "Settings", "Help").

Via an immediate access bar 203, menu items are made available to the user via individual, selectable elements by selecting an element directly.

A processing bar 204 is also shown with selectable options for determining the graph. In the first graphic structure file 103, this is a first selection element

205 is provided, with which a selection and processing of objects displayed on the screen is possible. The selection and processing of specific elements for a Petri network 201 is made available to the user 106 via a set 206 of further selection elements, which are explained in more detail below.

A second selection element 207 is described by an empty rectangle and symbolizes a time-bound transit.

A third selection element 208 symbolizes a timeless transition, which are shown as selected transition elements 220, 221 and 222 in the petri network 201.

A fourth selection element 209 symbolizes an edge, which in this exemplary embodiment is a directed edge.

A fifth selection element 210 symbolizes a forbidden edge designated according to the structure rules of a petri net 201.

A sixth selection element 211 symbolizes a position, wherein a position element 223, 224, 225, 226 is shown in each case in the petri network 201. The location elements 223, 224, 225 and 226 are connected to the transition elements 220, 221, 222 via edges 227, 228, 229, 230, 231 and 232.

A seventh selection element 212 symbolizes the possibility of combining a combination of several elements of the Petri network into one overall element.

An eighth selection element 213 symbolizes an input of the petri network 201 and a ninth selection element 214 symbolizes an output of a petri network 201.

Textual information 251, 252, 253, 254, 255, 256, 257, 258, 259, 260 and 261 are assigned to the edges and the individual nodes, that is to say the elements of the Petri network 201. net. In this way it is possible to assign an additional textual description to the individual elements.

If a second graphic structure file 104 is integrated into the editor program 107, the second graphic structure file 104 providing elements of an electronic circuit and thus a graph of an electronic circuit, the result is one shown in FIG Screen surface with a set of selection elements set up for the circuit simulation.

The same reference numerals are used in FIG. 3 for the same elements of the screen surface as are shown in FIG.

A set 301 of selection elements that are specific for describing a graph of an electronic circuit

A tenth selection element 302, which symbolizes an electronic resistance,

An eleventh selection element 303, which symbolizes an electronic capacitor,

A twelfth selection element 304, which symbolizes an inductance, a thirteenth selection element 305, symbolizing a transistor,

A fourteenth selection element 306, symbolizing an operational amplifier,

A fifteenth selection element 307, symbolizing an undirected edge, and

A sixteenth selection element 308, symbolizing a current source.

An electronic circuit 110 is determined by the user 106 and in this exemplary embodiment has a current source 311, electronic resistors 312, 313, electronic capacitors 314 and 315 and an operational amplifier 316 on, which are connected to each other via edges 317. A ground connection 318 is also shown in FIG. Textual information 319, 320, 321, 322, 323, 324, 325, 326 is assigned to the individual circuit elements for a more detailed explanation of the electronic circuit 310.

4 shows the method in its method steps to clarify the method.

In a first step (step 401), a graphic structure file 102, 103, 104, 105 is selected from a set 101 of graphic structure files 102, 103, 104, 105.

In a second step (step 402), a selection is made of elements which are available in accordance with the graphic structure file 102, 103, 104, 105 which was selected in the step before (step 401).

The selected elements are displayed by the editor program 107 in a further step (step 403).

5 shows a first computer 500 with a memory 502 and a processor 503, each of which is connected to one another and to an input / output interface 501 via a bus 504.

The first computer 500 is connected to a screen 505, a keyboard 506 and a computer mouse 507 via the input / output interface 501.

Furthermore, the first computer 500 is connected to further computers 510, 520, 530, 540 and 550 via a communication network 560, in the exemplary embodiment an ISDN network (Integrated Services Digital Network).

The set 101 of the graphic structure files 102, 103, 104, 105 is stored in the first computer 500. The further computers 510, 520, 530, 540 and 550 each likewise have a processor 513, 523, 533, 543 and 553 and a memory 512, 522, 532, 542 and 552 each. The processor 513, 523, 533, 543 and 553 and the

Memories 512, 522, 532, 542 and 552 are each connected to the communication network 560 via a bus 514, 524, 534, 544 and 554 via an input / output interface 511, 521, 531, 541 and 551. Furthermore, the other computers 510, 520, 530, 540 and 550 are each with a screen 515, 525, 535, 545 and 555 and a keyboard 516, 526, 536, 546 and 556 and a computer mouse 517, 527, 537, 547 and 557 connected.

An editor program 508, 518, 528, 538, 548, 558 is stored in each computer 500, 510, 520, 530, 540 and 550. A graphic structure file 102, 103, 104, 105 is selected by a user of a further computer 510, 520, 530, 540 and 550 and requested by the first computer 500 with a request message 570. The first computer 500 sends the selected graphic Structure file 102, 103, 104, 105 in a response message 580 to the further computer 510, 520, 530, 540 and 550 requesting the graphic structure file 102, 103, 104, 105.

The requesting further computer 510, 520, 530, 540 and 550 has thus received the requested graphic structure file 102, 103, 104, 105 and is integrating it into its editor program 518, 528, 538, 548, 558, such as described in the first embodiment.

Some alternatives to the exemplary embodiments described above are shown below:

The type of elements that are made available by a graphic structure file is generally arbitrary and diglich depends on the respective type of graph to be determined.

The technical system can, for example, also be a technical system that can be described in terms of its behavior or its structure by the graph.

The editor program and the graph displayed with the editor program can be used in the context of a simulation of the technical system.

The following publications are cited in this document:

[1] Publication on the Internet available on September 2, 1998 at the address:

http: //www.redac. co .uk / prod info / brochures / 14a .html

[2] G. Chiola, G. Franceschinis, R. Gaeta and M. Ribaudo,

GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets, Performance Evaluation, Special issue on Perfomance Modeling Tools, 24 (1 & 2), pp. 47 - 68, November 1995

[3] G. Schmidt, Fundamentals of Control Engineering: Analysis and design of linear and simple non-linear controls as well as discrete controls, second edition, Springer-Verlag, ISBN 3-540-17112-6, Berlin, pp. 320 - 328, 1991

Furthermore, an implementation of the exemplary embodiment described above is given, written in the programming language C, the implementation being carried out in three files

1. Initialization file:

package interfaces; * selected for the settings of 60 colors, fonts ... import java.io. *; * But unfortunately I am not allowed. Import java.util. *; * / Import] ava. awt. *; / * public void readFirst (Stnng

Import etc. *; 65 name) {import elements. *; Stnng configFile = new import mm. *; Stnng (name); import tools. *; int c;

// Properties properties = new public class initialization {70 Properties (); GraphEditor editor; // properties = Sy¬

// He has the tokens from the stem. getProperties (); File // filename = new stnng (".."

StreamTokenizer token; + proper- // Here come all 75 ties allowed. getProperty ("file. Separator" nodes and edges from the) + configfile); // .Ige file in. try {// The entries are referenced with the F le file = new names of the objects File (configFile); Hashtable objects; 80 // FilelnputStream in = new // The current .Ige file FιleΙnputStream (fιle); // stnng configFile; FileReader in = new File- // is now in the setting reader (file); lungs token = new StreamTokenizer (in); * All attributes are in here. // set options * / for token hashtable attribute names; to- / ** 90 ken.eolIsSignificant (true);

* here are the entries for token. quoteChar ('"'); the Tools // token menu. quoteChar ( ^! \ '');

* inside. // token. quoteChar ('{');

* / token. quoteChar ('}'); Hashtable tools; 95

// read over {and, and; public initialization (GraphEditor editor) (ken. whitespaceChars ('(', '(') this. editor = editor; togobjekte = new Hashtable (] 100 ken. whitespaceChars (',', ',') attribute name = new Hastohtable (); ken. whitespaceChars (';', ';') tools = new Hashtable));}

105 boolean done = false; while (finished) {

/ ** switch * This method was the er (c = toke. nextToken ()) (ste initialization file case StreamTokenizer. TT EOF: c = token. nextToken (); fertιg = true; break; 65 // system. out. prιnt ("ert2" + tocase StreamTokeniken. nval); zer. TT WORD: int g = lf (int) token. nval;

(token. sval. equals ("DATAPATH")) (

70 c = token. nextToken () c = token. nextToken (); lf (c == "") {// system, out. pπntln ("Wert3" + Sytoken. nval); stem, out. prmtln ("DATAPATH" + int b = token. sval); 75 (int) token. nval;

} break; //System. out. flush ();

} over beef (from ähl, r, g, b);

(token. sval. equals ("DATAFILTER"))) break; c = token. nextToken (); ) lf (c == "") (lf Sy85 (token. sval. equals ("FONTS")) {stem, out. prιntln ("DATAFILTER" ^■ while (c '= ^■ )' token. sval); break; c = token. nextToken ();} 90 if (c == Stre- amTokenιzer.TT_W0RD) {

(token. sval. equals ("FILELIST")) {stand out while (c '= ^■ )') option = token. sval; {

95 // system. out. print ("FONT" + toc = token. nextToken () ken. sval); if (c == c = token. nextToken (); ediStnng fontor. getMenueleiste (). addFileToMen 100 name = token. sval; u (token. sval);

} // system. out. print ("NAME" + to) ken. sval); break;

1 1 05 c = token. nextToken () if Stnng style (token. sval. equals ("COLORS")) {token. sval; while (c '=') ')

//System. out. print ("STYLE" +

110 token. sval); c = token. nextToken (); if (c == Stre- c = token. nextToken (); amTokenιzer.TT_W0RD) {int size

Stnng out = (ιnt) token. nval; choice = token. sval; 115 transfers (selection, font name, style, size); c = token. nextToken ();

//System. out. pπntln ("SIZE" +

//System. out. print ("Wertl" + totoken. nval); ken. nval); 120) int r =) (int) token. nval; break; if) (token. sval. equals ("SHORTCUTS") break; (65) while (c! = ')') if ((token. sval. equals ("WINDOWSIZE"))

(c = token. nextToken (); if (c == "") 70 c = token. nextToken (); int x

String = (int) token. nval; mpunkt = token. sval; c = token. nextToken ();

//System. out. print ("MENUPUNKT" + 75 token. sval); c = token. nextToken (); int y c = token. nextToken (); = (int) token. nval;

String iconl = token. sval; 80 // size. setSize (x, y); break;

//System. out. print ("ICONl" + to) ken. sval); if (token. sval. equals ("WIND0WP0SITI0 c = token. nextToken (); N")) {

String icon2 = token. sval; c = token. nextToken (); int x

//System. out. printin ("IC0N2" + = (int) token. nval; token. sval); 90 edic = token. nextToken (); goal . getShortcut bar (). addShortB utton (); c = toke. nextToken ();

) int y

) 95 = (int) token. nval; break; } // location. setSize (x, y); if break; (token. sval. equals ("ACCELERATOR")}

) (100 if while (c! = ^■ } ') (token. Sval. Equals ("AUTHOR")) {c = token. NextToken (); c = token. NextToken (); if (c == "") (if (c == "") (105 SyString late, out. printin ("AUTHOR" + tobel = token. sval; ken. sval);

)

// system, out. print ("MENUPUNKT" + break; token. sval); 110 1 if c = token. nextToken (); (token. sval. equals ("TOOLS")) {if (c == while (c! = '}') StreamTokenizer.TT_WORD) ({char cut = 115 token. sval. charAt (0); c = token. nextToken (); if ( _C == "")

//System. out.printin ("KEYS" + (cut); String path edi- 120 = new String (token. sval); tor. getMenueleiste (). addShortcutT oVector (label, cut); // System. out. printin ("TOOL "+ token. sval);

) c = token. nextToken (); // Set the options

String fi- 65 for token leNa e = new String (token. Sval); token. eollsSignificant (false);

//System. out. printin ("TOOL" + token. quoteChar ('"'); token. sval); // token. quoteChar ('\' '); 70 // token. quoteChar (' ('); c = token. nextToken ( ); token. quoteChar ('}'); String text

= new String (token. sval); // read (and, and; to-

//System. out. printin ("TOOL" + 75 ken. whitespaceChars ('(', '{' token. sval); toediken. whitespaceChars (',', ',' tor. getMenueleiste (). addToolToVec totor (path, fileName, text); ken.whitespaceChars (';', ';'

} break; } else boolean done = false; break; while (! finished) (85 switch default: (c = token. nextToken ()) (case StreamTokenizer .TT_E0F: finished = true; in. close (); 90 break;

System. out. flush (); case StreamTokeni-

System. out. printi ("READ zer .TT_W0RD: THE FILE" + configFile + "if DONE!"); (token. sval. equals ("TOOLBAR")) (95 Sy¬

} catch stem, out .printin ("Read Toolbar"); (FileNotFoundException e) {readTool-

System. err. printin (conbar (lgcPath); figFile + "is not found"); break;

) catch (IOException e) {100} e.printStackTrace (); if) (token. sval. equals ("MENU")) {) // read first Sy * / stem, out. printin ("Read menu"); 105 readMenuf); break;

* This method reads an if toolbar. (token. sval. equals ("ANALYSISBAR")

* It requires the path to the 110) file and the file name. Sy * / stem. out. printin ("Read Analysis- public void readSecond (String Bar"); lgcPath, String file) {readAnalyse ();

String configFile = new 115 break; String (lgcPath + file); ) int c; if try {(token. sval. equals ("SHORTCUTS"))

File file = new {File (configFile); 120 sy

FileReader in = new file system, out. printin ("Read Short-Reader (file); cuts"); token = new StreamTokeni- readShorts (); zer (in); break; // c = token. nextToken (); if // system. out .printin ("IN (token. sval. equals (" ACCELERATOR ") 65 the TOOLBAR" + c);) ()

Sy) catch (IOException e) (stem, out. Printin ("Read Accelera- e.printStackTrace (); tor");) readAccel (); 70 // system. out .printin ("Finish break; Toolbar"); ) default:

1 75 private void readNode (String lgcPath) (in. Close (); int c = '{';

System. out. flush (); String type name = new system. out. printin ("READ String (); THE FILE" + configFile + "String image = new String (); DONE!"); Vector corners = new Vector (); // and important for the AnzeiVector connectors = new Vecge: tor (); setLayer (); Vector connectorNames = new setAttributNames (); 85 vector (); } catch Attribute attribute = new (FileNotFoundException e) {StandardAttribute ();

System. err. printin (conColor color = new CodeFile + "is not found"); lor (255,255,255);

} catch (IOException e) {90 // system. out. printin ("An e.printStackTrace (); node"); ) try {while (c! = ')') {switch (c) {private void readToolbar (String 95 case StreamTokeni- lgcPath) {zer.TT_WORD: int c = '{'; // Will no longer be objects. clear (); required // system. out .printin ("Now // if the toolbar is coming"); 100 (token. Sval. Equals ("TYPE")) (try {// while (c! = ')') (C = token. NextToken (); switch // Sy (c = token. NextToken ()) { stem. out. printin ("Read TYPE" + case StreamTokeni- 105 token. sval); zer.TT_WORD: // break; if //) (token. sval. equals ("NODE")) {if (token. sval . equals ("NAME")) (

//System. out. rintin ("Read Kno110 ten"); c = token. nextToken (); readNode (lgcPath); type name = new break; String (token. Sval);

// Syif stem, out. printin ("Read NAME" + (token. sval. equals ("EDGE")) (type name); break;

//System. out. printin ("read edge"); if readEdge (lgcPath); 120 (token. Sval. Equals ("ATTRIBUTES")) break; (attribute = new default: StandardAttribute (); while ((c = token.nextToken ())! = '}') {attribute);

String aname = 65 knonew String (token. Sval); ten. setColor (color); c = to // Syken. nextToken (); stem. out. printin ("set color" +

String value = new color); String (token. Sval); 70 // Create button attribumit tool for toolbar. addAttribute (aname, value, true); ToolButton b = new attributNaToolButton (lgcPath + "i ages /" + men. Put (aname, aname); image,

// Sy75 stem, out. printIn ("Read attribute type name, te" + attribute); new node tool (editor, type name), break; editor. getToolbar ()); ) ediif tor .getToolbar () .addToolButton (b) (token. sval. equals ("IMAGE")) (

I I entry in the c = token. nextToken (); 85 hash sections image = new gobjek-String (token. Sval); te.put (type name, node);

// Sy // system. out. printin ("Read IMAGE" + stem, out. printIn ("In Hashtabeile: image); 90" + gobjekte); break;

} break; if} (token. sval. equals ("FILLEDPOLYGON if")) (95 (token. sval. equals ("POLYGON")) (ek- ek- ken. removeAHElements (); ken. removeAllElements (); int x, y ; int x, y; while while ((c = token.nextToken ())! = ')') (100 ((c = token.nextToken ())! = ')') fx = x = (int) token . nval; (int) token. nval; c = token. nextToken (); c = token. nextToken (); y = 105 Y =

(int) token. nval; (int) token. nval; ek- ek- ken. addElement (new Point (x, y)); ken. addElement (new Point (x, y));

// Sy // system, out. printin ("Read POLYGON" + 110 stem, out. printin ("Read POLYGON" + corners); corners);

)}

// now should // now all data should be there and all data should be there and it

// A node prototype can be created. prototype can be generated.

GraphObjekt knoten = GraphObjekt knoten = new FilledPolygonKnoten (type name, new PolygonKnoten (type name, corners, 120 corners, connectors, connectors, cannector names, cannector names, attribute); connectors, knots. setColor (color); connector names,

// system, out. println ("set color" + attribute); color); kno¬

// Create button 70th. SetColor (color); with tool for toolbar // Sy¬

// The button grabs stem, out .println ("set color" + over the type name on the Richticolor); gen // create button

// knot closed. 75 with tool for toolbar

ToolButton b = new ToolButton b = new ToolButton (lgcPath + "images /" + ToolButton (lgcPath + "images /" + image, image, type name, type name, new node tool (editor, type name), new node tool (editor, type name), editor. getToolbar ()); editor. getToolbar ()); edieditor .getToolbar () .addToolButton (b) tor .getToolbar () .addToolButton (b)

// Entry in the I I entry n the hash table hash table gobjek- 90 gobjekte.put (type name, node); te.pu (type name, node);

//System. out .println ("In hash // // System. out. println (" In hash table: "+ objects); belle:" + objects);

95 break; break; )) if if (token. sval. equals ("FILLEDOVAL")) (token. sval. equals ("OVAL")) {{100 int breιte = 10; int breιte = 10; mt height = 10; int height = 10; while while ((c = token.nextToken ()) '='} ') {((c = token. nextToke ())' = '}') (width = width = 105 (int) token. nval; (int ) token. nval; c = token. nextToken (); c = token. nextToken (); height = height = (int) token. nval; (int) token. nval; 110 // Sy¬

// system, out. println ("Read OVAL" + stem, out. println ("Read OVAL_FILL" token. nval); + token. nval); )

) // now should

// now all data should be there 115 and there should be all data and // it can be a node

// a node prototype can be created. prototype can be generated. Knot graph object

GraphObject node = new oval node (type name, = new filled oval node (type name, 120 height, height, width, width, // Syconnectors, stem, out .println ("The names:" + connector names); connectorNames, 65) break; attribute); ) knoif ten. setColor (color); (token. sval. equals ("COLOR")) (

// Sy70 stem, out. println ("set color" + c = token. nextToken (); color);

// Create button // system. out. println ("Read COLOR" with tool for toolbar 4 token. nval);

ToolButton b = new 75 int r = ToolButton (lgcPath + "images /" + (int) token. Nval; image, c = token. NextToken (); type name,

//System. out. println ("Read COLOR" new node tool (editor, type name), + token. nval); int g = editor. getToolbar ()); (int) token. nval; editor. getToolbar () .addToolButton (b) 85 c = token. nextToken ();

_/ / Entry into the // system. out. println ("Read COLOR"

Hashtables + token. nval); gobjekint b = te. put (type name, node); 90 (int) token. nval; color = new Co¬

//System. out. println ("In Hashtalor (r, g, b); hurry up:" + gobjekte); break; break; 95 default:)) // switch if c = token. nextToken (); (token. sval. equals ("CONNECTORS")) // Sy (stem, out. println ("NEXT Konnekto100 TOKEN" + token. sval); ren. removeAllElements ();} // while int x, y; // c = token.nextToken (); String name;) catch (IOException e) {while e. printStackTrace (); ((c = token. nextToken ())! = ')') (105) x = // System, out .println ("Bende (int) token. nval; readNode"); c = token. nextToken (); ) // readNode y = 110

(int) token. nval; c = token. nextToke (); private void readEdge (String name = tolgcPath) (ken. sval; 115 // System. out. println ("Ein konnektoKante"); ren. addElement (new Point (x, y)); int c = '{'; konnektorNaString type name = new men.addElement (name); String ();

// Sy120 String image = new String (); stem, out. println ("Read KonnektoAttribute attribute = new ren" + connectors); StandardAttribute (); 00/14

23

Color color = new color (255, 255, 255); c = token. nextToken (); try (65 mkel = while (c '=') ') ((int) token. nval; switch (c) {// Sycase StreamTokem- system, out. println ("Read Arrow" + zer.TT_WORD: radιus + Winkel) ;

70} if // now (token.sval.equals ("NAME")) all data should be there, and it

// can token an edge. nextToken (); prototype can be generated. type name = new 75 graph object edge = string (token. sval); new arrow edge (type name,

// system, out. println ("Read NAME" + radius, type name); break; wmkel, f attribute); (toke. sval. equals ("ATTRIBUTES") kante. setColor (color); attribute = new 85 // SyStandardAttribute (); stem, out.println ("Set color" + while color);

((c = token. nextToken ()) '='} ') {// create button

String aname = with tool for toolbar new String (token. Sval); 90 ToolButton b = new c = to- ToolButton (lgcPath + "images /" + ken. NextToken (); image,

String value = new String (token. Sval); type name, attribu95 te. addAttribute (aname, value, true); new EdgesTool (editor, type name), attribute names. put (aname, aname); editor. getToolbar ());

// system, out. println ("Read Attribute- 100 tor. getToolba (). addToolButton (b) te" + attribute);

// entry in the hash section break; gobjek¬

105 te. put (type name, edge); if (token. sval. equals ("IMAGE")) {// system. out.println ("In hash table:" + objects); c = token. nextToken (); image = new 110 break; String (token. Sval); )

// Syif stem, out. println ("Read IMAGE" + (token.sval.equals ("POINT")) (image); int through = 10; break; 115 while ((c = token.nextToken ()) '=') ') (if by =

(token. sval. equals ("ARROW")) ((int) token. nval; int radius = 10; // Syint wmkel = 10; 120 stem, out .println ("Read Point" + while through);

((c = token. nextToken ()) '=') ')) radius = // now (int) should token. nval; all the data will be there and it // can create an edge // create button prototype. with tool for toolbar

GraphObject edge = ToolButton b = new new circle edge (type name, 65 ToolButton (lgcPath + "images /" + image, by, type name, attribute); kan70 new Edge Tool (editor, type name), te. SetColor (color);

// Syeditor. getToolbar ()); stem, out .println ("set color" + edicolor); goal . getToolbar (). addToolButton (b)

// Create button 75 with tool for toolbar // Entry in the

ToolButton b = new hash table ToolButton (lgcPath + "images /" + gobjekimage, te. Put (type name, edge); type name, // System. Out .println ("In hash table:" + objects); new edge tool (editor, type name ), break; editor. getToolbar ()); 85 editor. getToolbar (). addToolButton (b) if (token.sval.equals ("SIZE")) {

I I entry m the hash sections 90 c = token. nextToken (); gobjekSyte. put (type name, edge); stem. out. println ("Read SIZE" + token. nval);

//System. out. println ("In Hashtabreak; hurry up:" + objects); 95 if break; (token.sval.equals ("COLOR")) (1 if // System. out. println ("Read COLOR" (token.sval.equals ("NOEND")) {100 + token. nval); while c = token. extToken (); ((c = token.nextToken ()) '=') ') {int r =

// token by = (int). nval; (int) token. nval; 105 // Syc = token. nextToken (); stem, out .println ("Read Point" + through); //System. out. println ("Read COLOR"

) + token. nval);

// now 1 10 int g = all data should be there and it (int) token. nval;

// an edge prototype can be created. c = token. nextToken ();

GraphObject edge = new standard edge (type name, 115 // System. Out. Println ("Read COLOR" + token. Nval); attribute); int b = kan (int) token. nval; te. setColor (color); color = new co-

// Sy120 lor (r, g, b); stem, out. println ("set color" + // sycolor); stem, out .println ("Read color:" + color); break; // hand over private void

} (String mpunkt, String default: lconl, String ιcon2) () // switch // public void addBut- c = token. nextToken (); 65 ton (String menu item, String // Syimagel, String ιmage2) stem, out. println ("NEXT TOKEN" + token. sval); private void pass (String) // while selection, String name, String style,

// c = token. nextToken (); 70 int size) () catch (IOException e) (int styleint = 0; e.printStackTrace (); switch (style. CharAt (0)) {) case 'B ¹ :

// system. out .println ("Bende styleint = Font. BOLD; readEdge"); 75 break; case 'P':

) // readEdge styleint = Font.PLAIN; break; case 'I': private void readMenu () (styleint = Font. ITALIC; tools. clear (); break; int c = '('; default: try {styleint = Font.PLAIN; while) ((c = token. nextToken ()) '=') ') (85 font blow = new font (name, // c = token. nextToken (); styleint, size); string name = toswitch (selection. charAt (0)) (ken. sval; case 'M':

System. out .println ("Now the menu comes up" + name); 90 gates. getMenueleiste (). setFont (blows c = token. nextToken ();); String call = tobreak; ken. sval; case 'P':

System. out. printIn ("Now // there is still a menu to implement" + call); 95 break; tools .put (new case 'S': String (names), new ediString (call)); goal . get status bar (). setFont (on

) t); } catch (IOException e) (100 break; e. printStackTrace ();))

) transfer private void (String 105 selection, int r, ιnt g, mt b) {private void read analysis () | if (selection. equals ("PAPER")) (system. out. println ("Now the analysis is coming up"); tor. getZeichenflaeche (). setBackgr ound (new Color (r, g, b)); 110) private void readShorts () {if (selection. equals ("GRID")) (system. out .println ("Now // the shortcut is yet to be implemented"); 1 if 115 (selection. equals ("MENUBGC")) {private void readAccel () {// edi¬

System. out .println ("Now tor. getMenueleiste (). setBackgroun the Accelerators are coming"); d (new color (r, g, b)); 1} 120 if

(selection. equals ("MENUFGC")) { // menubar. setForeground (new * Hashtable of the class GraColor (r, g, b)); phObject on,) 65 * -> all objects are displayed. (selection. equals ("STATUSBGC")) {* / edipublic vo d setLayer () {tor. get status bar)). setBackgrou Hashtable all = new Hasnd (new Color (r, g, b)); 70 htable (objects. Sιze (), 1.0f); ) Enumeration e = gobjekif te. keys ();

(selection. equals ("STATUSFGC")) (while (e. hasMoreElements ()) edi (tor. getStatusleiste (). setForegrou 75 String key = nd (new Color (r, g, b)); (String) e. nextElement ();} all. put (key, new if String (key)); (selection. equals ("TOOLBGC")) {) ediGraphObjekt. toShow = all; tor. getToolbar (). setBackground (ne) w Color ( r, g, b)); ) ** if * Returns all displayable (selection. equals ("TOOLFGC")) {85 layers. edi- * / tor. getToolbar () .setForeground public enumeration getLayers () (new Color (r, g, b)); (

} return objects. keys (); if 90 (selection. equals ("SHORTCUTBGC")) (editor. getShortcutleiste (). setBackgr * Returns the maximum number oand (new Color (r, g, b)); the layers back.) 95 * / if public int countLayers () {(selection. equals ("SHORTCUTFGC")) {return objects. size (); edi) gate. getShortcut bar (). setForegr ound (new Color (r, g, b)); 100 / * +

) * This method adds all attribute names that can be displayed in the

* Hashtable of the attributes class,

* Provides a copy of a 105 * -> all attributes are shown on a graph object. * back. * / * / public void setAttributNames () public GraphObject getOb- (jekt (String name) {110 Hashtable alle = new Hasif htable (attributNamen. sιze (), 1.0f) (gobjekte.contamsKey (name)) {GraphObjekt father = enumeration e = attributNa (GraphOb ekt) gobjekte.get (name); men. keys (); return 115 while (e .hasMoreElements ()) (GraphObj ekt) vater. copy (); () eise {String key = return null; (String) e. NextElement (); all. Put (key, new

) 120 string (key));

} / ** attributes. toShow = all;

* This method includes all displayable object types in the * Hashtabel.

* Returns all displayable * / attribute names. public void addAttributName (

* / 25 String name) {public enumeration getAttri- attribute name. put (new butNames () {String (name), new String (name)); return attribute name. keys (); 1 )

30 / ** / ** *

* Returns the maximum number * / of attributes. public Hashtable getTools () (

* / return tools; public int countAttributNa- 35} mes () {return attributeNamen. size (); // public string getConflgFile ()} f

// return configFile; 40 //) * Adds an attribute name in the

2nd Load file

package commands; 80 if

(param [0] .endsWith (".Ige") || import etc. *; pa- import java.util. *; ram [0]. endsWith (". lgf") II

Import java.awt. *; pa- import java.io. *; 85 ram [0]. endsWith (". Igt")) (import interfaces. *; // we were called from the command line ** File file = new

* Loads a graph from a file (param [0]); . lgf file. 90 * / // system. out. println ("The path public class Load extends command" + file. getParent ());

Vector undo; //System. out .println ("The name: 95" + fιle.getName ()); public Load (GraphEditor editor) {fe (file. getParent () + "/", file. getN super (editor); ame ()); undo = new vector (); } else {help = 100 // nothing

"<fllename. lgf /. Ige /. lgt>"; )) break; default // execute too much parameter public void (String [] 105 break; param) () // switch

//System. out. println (para); int number = param. length; switch (number) (execute public void (String case 0: // with no Ar110 param) (gument we do nothing. edibreak; tor. getStatusleiste (). show ("Load. case 1: // with an Ar .."); gument is only checked ¹

115 ((Component) editor). setCursor (Cur sor. getPredefinedCursor (Cursor .WA IT_CURSOR)); undo. addElement (deleted);

FileDialog fd = new FileDia- 65) log ((Frame) editor, null, FileDialog) // else .LOAD); edi¬

// Unfortunately, this has no goal. getZeiegenflaeehe (). drawBuffe effects in Windows and Solar (editor. getGraph ()); ris 70

// from 1.1.6 it works ((Component) editor) .setCursor (Cur sor. getDefaultCursor 0); fd. setDirectory (System. getPropert ediy ("user .dir")); goal. get status bar (). show ("Done" // that's already 75) fd.setFile ("noname.lgf"); FilenameFilter filter = new lgFilter (); Makes file load back. setFilenameFilter (filter); gig. fd. show (); * / String dir = public void undo () (fd.getDirectory (); edi¬

String file = fd. getFile (); goal . get status bar (). show ("Undo: // fd. getFile () returns null load ..."); if canceled! 85 if (file <== null) (((Component) editor). SetCursor (Cur // nothing to do sor. GetPredefinedCursor (Cursor .WA IT_CURSOR));

((Component) editor). setCursor (Cur if (lundo.isEmpty ()) (sor.getDefaultCursor ()); 90 Vector insert = return; (Vector) undo.lastElement ();} eise {if (insert! = null) {

// load editor. getGraph (). removeAll ()

//System. out .println (fd.getDirect 95 ediory ()); goal . getGraph () .add (insert)

//System. out .println (fd. getFile () insert. removeAllElements ()

Vector deleted 100 = editor. getGraph (). removeA undo. removeElement (undo. lastEleme 11 (); nt ()); check (dir, file); ) editor. getGraph (). setChanged (false); 105 gate. getZeiegenflaeehe (). drawBuffe editor. setselection (new vector (editor. getGraph ()); tor ()); edi¬

Vector lastCommands = editor. getGraph (). setChanged (true); goal . getLastCommands (); ediif (lastCommands. size () <110 tor .get status bar (). show ("Done" 10) {); lastCommands. addElement (this); ((Component) editor). setCursor (Cur) ice {sor. getDefaultCursor ()); lastCom115) // undo mands. removeElementAt (0); lastCom / ** mands. addElement (this); * Load file repeatedly ..

) * / if (undo.size () <10) (120 public void redo () {ediundo. addElement (deleted); tor .getStatus bar (). show ("Redo:) eise {Load ..."); undo. removeElementAt (0); To run ( ) ; ) / / redo) else if (file. endsWith (". lgf")) (

//System. out. println ("a

* This class unfortunately becomes 65 lgf file "); not on file f = new file (path +

* the Windows or Solaris Comfile); component if (f .ex sts ()) (

* passed on. settings. flleName = da * / 70 tei; class lgFilter implements Fi- // we get the lenameF lter (name of the .Ige file: public boolean accept (File String config = edidir, String name) {tor .get file interface () .getCo return (na- 75 nfig (path 4- file); me. EndsWith (".lgf") || // System. Out. Println ("The new name of the Lgc file" 4- conme. EndsWith (".Ige") | | fig); naf = new me. endsWith (".Igt")); File (settmgs. lgcPath + config); if (f .exists ()) (

// is this Ige file

/ 'already loaded ⁰

* This method checks if if is the correct 85 (settmgs. ConfigFile. Equals (confi * configuration file loaded g))), otherwise // we only need the

* tries to load the correct file to lalgf. (-> Reset editor) edi¬

* Then the desired 90 gate. get file interface (). load (.Igt or .lgf file path, file, editor. getGraph ());

* loaded. settings. frameName = * / settings. fιleName + "" private void tests (String 4-settιngs .appName 4- "" path, String file) {95 4-settmgs. Copyright; Settings settmgs = edi ((Frame) editor). setter. getSettings (); Title (settings. FrameName); if (file. endsWith (". Ige")) {} else {// system. out. println ("a // we also need ig file"); 100 load the configuration file File f = new File (path + settings .appName = file); Settings. format (config); if (f.existsO) (settings. configFile = settmgs. appName = Einnew String (config); positions. format (file); 105 settmgs. frameName = settmgs. fιleName = ""; settings. f leName4 "" settmgs. frameName = set4-settιngs .appName 4- "" tmgs. fιleName + "" + settmgs. Copyright; 4-settmgs. appName + "" // we start the 4-settιngs. Copyright; 110 Editor new settings. configFile = new editor. start ( );

String (file); edisettings .lgcPath = new tor .get file interface (). load (String (path); path, file, editor.getGraph ());

// we restart the editor 115} new {editor. begin ( ) ; Sy) eise {stem, err. println ("File not found

System. err .println ("File:" 4- settings .lgcPath 4- config); not found: "4- settings .lgcPath 4- 120) file);) else {) System. err .printl (" File not found: "+ path + file); ) 50 Interpre¬

//begin () ; ter. setFile (path + file)} else if (file. endsWith (". igt")) (// System. out. println ("a // file interface (). load (path, Igt file"); 55 file, editor getGraph ());

File f = new file (path 4 // settmgs. FrameName file); = settings. appName + "" 4 setif (f .exists ()) {tings. fileName; settings. fileName = da // ((Frame) editor). tei; 60 setTitle (settings. FrameName); settings. frameName = set //) ice {tmgs. fιleName + "// we also have to load 4-settmgs. appName 4-" "the configuration file 4-settιngs. Copyright; // settings .appName =

// we still get the 65 settings. format (config); Name of the .Ige file: // settings. configFile

// String config = edi = new String (config); tor .get file interface (). getCo // settmgs. frameName nfig (path + file); = settmgs .appName + "" 4- set¬

//System. out. println ("The 70 tmgs. fileName; new name of the Lgc file" 4- con // we start the fig); New editor

// f = new // editor. begin ( ) ; File (settings. LgcPath 4 config); // Lgtlnterpreter In // if (f.existsO) {75 terpreter = new Lgtlnterpre¬

// is this Ige file ter (editor, path 4 file); already loaded? // edi // if tor. setinterpreter (interpreter); (settings. configFile. equals (confi // Interpreg)) {ter, start ();

// we just have to load the //) Igt file and interpret //) eise {ren // SyLgtInterpreter mter- stem, err. println ("File not found preter = editor. getlnterpreter (); 85:" + settmgs .lgcPath 4 config);

//)

//System. out. println ("The Inter} ise {preter:" 4-Interpreter); System, err .println ("File if (Interpreter == not found:" 4- path + file); null) {90}

Interpreter = new} eise (Lgtlnterpreter (editor, path 4- daSystem. Err. Println ("usage: tei); java LoGraph2 <path to config- edifιles> AND <fιle.lgc> OR tor. Setlnterpreter (Interpreter); 95 < fιle.lgf> OR <flle. lgt> ");

Interpreter, start ();

} ice {

3rd Toolbar file

package mmi; 110

/ 'import j ava. awt. *; * About the current tool of import j ava. awt. event. *; They become toolbar

* User mouse actions on import etc. *; 115 passed the graph. import tools. *; * The toolbar allows the int w = getSize () .width- to add and remove msets. left-insets. πght;

* from ToolButtons and their ActionListeners belonging to int h = getSize () .height. 65 insets. top-msets .bottom; * / public class toolbar extends Pag. setColor (editor. getEmstellunge nel {n (). toolbarBgCo);

GraphEditor editor; for (int ι = 0; KborderSize; Tool currentTool; 70 14- +) {ToolButton currentButton; int borderSize = 4; g.draw3DRect (l + msets. left, l + mse ts. top,

* The constructor creates the w-2 * ι-l, h selection tool, 75 2 * ι-l, κborderSιze / 2); * since this should always be present). * / public Toolbar (GraphEditor editor) {* Adds a ToolButton. this. editor = editor; * / setLayout (new BarLay- public void addToolButout (BarLayout. VERTIKAL, 2)); ton (ToolButton button) {setBackgro- add (button); and (editor. getEmteilungen (). too lbarBgCo);

// add a small gap (new space (5, 24)); * Removes a ToolButton. * /

ToolButton b = new ToolBut- 90 public void deleteTooleButton (editor. GetEmancements () .Ige ton (ToolButton button) {Path 4

"images / selection. gif", / **

95 * Sets the current tool; "Select", * is normally called by the ToolButtons. new selection tool (editor), thιs); * / setCurrentTool (b.getTool ()); public void setCurrentTool (Tool setCurrentButton (b); 100 currentTool) (add (b); this. currentTool = currentadd (new Space (5, 24)); Tool;) this. currentTool. reset (); )

105 public Insets getlnsets () {** Insets insets = * Set the current button, (Insets) (super. Getlnsets ()). clone the next ^{) ; * current butts him back. top + = borderSize; 110 can put. msets.left + = * / (borderSιze + 2); public void setCurrentButinsets .bottom + = borderSize; ton (ToolButton currentButton) {insets. right + = if (this. currentButton ^{l =} (borderSιze + 2); 115 null) return insets; this. currentButton. set up ( ) ; this. currentButton = currentButton; public void paint (Graphics g) this. currentButton. setDown (); super .pamt (g); 120 insets insets = great. getlnsets (); * Returns the current tool public ToolButton getCurrent-. Button () (

* is normally used by the return currentButton; Called canvas. ) * / 20 public Tool getCurrentTool () (/ ** return currentTool; * Returns the editor to the) buttons.

* / / ** 25 public GraphEditor getEditor ()

* Returns the current but {ton, so that the next return editor;

* Current button can reset it. * / 30) // Toolbar

Claims

claims

1. A method for determining a graphic structure of a technical system, a) in which a graph structure file is selected from a number of different graph structure files, a graph structure file specifying which elements each whose representation can be selected in order to graphically describe the technical system in its structure, b) in which elements are selected in such a way that the technical system is described with the selected elements, and c) in which the elements are presented by an editor program - Provides in which the selected graph structure file has been integrated, which determines the graphic structure of the technical system.

2. The method according to claim 1, wherein the technical system is an electronic circuit.

3. The method according to claim 2, wherein the technical system is a technical system.

4. The method according to any one of claims 1 to 3, wherein the elements are graph elements of a graph that describe the technical system.

5. The method according to any one of claims 1 to 4, wherein the specific graphic structure of the technical ^¬ Sy stems is checked for predefined structural rules out.

6. Arrangement for determining a graph structure, a) with a memory in which a number of different graph structure files are stored, each being specified in a graph structure file is which elements can be selected for their representation in order to form a graph, b) with a selection unit with which a graph structure file can be selected from the set of graph structure files, c) with a processor, which is set up in such a way that an editor program can be executed, with which editor program a graph with elements of the selected graph structure file can be determined using a graph structure file selected from the set of graph structure files , with which the graph structure is determined, d) with a display component coupled with the editor program, with which the specific graph structure can be represented.

7. Arrangement according to claim 6, in which the graph describes a structure of a technical system.

8. Arrangement according to claim 7, wherein the technical system is an electronic circuit.

9. Arrangement according to claim 7, wherein the technical system is a technical system.

10. Set of several arrangements for determining a graph structure, a) with a first arrangement which has a memory in which a number of different graph structure files are stored, each being specified in a graph structure file, which elements can be selected for their representation in order to form a graph, b) with a second arrangement coupled to the first arrangement and having the following components: a selection unit with which a graph structure file can be selected from the set of graph structure files,

an editor program with which, using a graph structure file selected from the set of graph structure files, a graph with elements of the selected graph structure file can be determined, with which the graph structure is determined,

- A display component coupled to the editor program, with which the specific graph structure can be displayed.

11. A set of arrangements according to claim 10, wherein the first arrangement and the second arrangement are coupled to one another via a communication network.

12. Set of arrangements according to claim 10 or 11, in which the graph describes a structure of a technical system.

13. The arrangement according to claim 12, wherein the technical system is an electronic circuit.

14. Arrangement according to claim 12, wherein the technical system is a technical system.