DE2743176A1 - Junction programmable control with logical function modules - has modules in matrix array and junction matrix programmable by decision tables - Google Patents

Abstract

The decision table is used to programme the junction matrix and may be employed in a logic control having fixed wiring if memories and timing elements are included. Signals coming from the process, supplied e.g by measuring transducers or limit indicators, are inverted in an inverter stage (INV) to provide active signals for further processing. The signals and inverter signals are fed to an AND-matrix where they are linked logically according to the decision table. The higher packing density of integrated circuits is utilised to an optimal degree.

Description

Link programmable controller

For extensive control or monitoring tasks, electronic Systems used that consist of hard-wired assemblies with logical functions are constructed. The logical assemblies are made according to the rules of Boolean algebra linked together. The structure of the circuits required for this is very laborious. It is true that there are inexpensive logical function blocks in integrated technology available, but the interconnection of these blocks is extremely extensive and afflicted with numerous possibilities for errors.

So-called diode matrices are used for flexible logic circuits known, which include a crossbar and diodes, which are in a plug-like Housing are installed and at the intersection points of the crossbar distributor in corresponding recesses can be inserted. Such diode matrices are only suitable for smaller controls and are mainly used for laboratory purposes used.

When using electronic data processing systems, you can extensive sequence controls programmed with the help of decision tables will. However, the decision table technique requires a very large number of logical links, although when using a computer with a corresponding Program can be implemented relatively easily, but not with a hardwired one Circuit. At a hardwired circuit was previously the ffir an application of the decision table technique required wiring effort too large.

The invention is based on the object of a hard-wired connection programmable To create control with logical function blocks that are inexpensive to manufacture is.

According to the invention, this object is achieved by a die-like Arrangement of the logical function modules and one by means of decision tables programmable three-dimensional connection matrix.

The invention solves the problem that on the one hand when using integrated circuits have a very high packing density of logical functions is possible, but on the other hand the wiring effort for the integrated circuits increases disproportionately among each other. When applying the invention can the high packing density of integrated circuits can be better utilized because the matrix-like arrangement of the logical function blocks a link with With the help of a three-dimensional wiring matrix.

This arrangement allows the use of decision tables for hard-wired programming of connection and sequence controls, as well for monitoring tasks. With a matrix-like arrangement of the logical function blocks a decision table immediately indicates the required interconnection. the Interconnection can therefore be derived directly from the decision table in a cost-effective manner and in particular can also be produced by machine. With the decision table technique is a good overview and easy configuration of linking and Sequence controls given.

The invention is explained by way of example with reference to the accompanying figures. Show it: FIG. 1 shows an example of a decision table, FIG 2 shows the structure of a controller according to the invention, FIG. 3 shows the principle an extension of a control according to the invention with regard to the conditions, FIG. 4 shows the principle of an extension with regard to the rules, FIG. 5 shows the principle of an expansion with regard to the actions, Figure 6 shows a spatial Structural representation of the invention.

Figure 1 shows an example of the structure of a decision table for Control of a process. As measured variables or monitoring signals from the process the conditions b1 to b5 are plotted in the horizontal lines. Thereby means a Y indicates the presence and an N indicates the absence of the relevant condition. An empty field means that the relevant condition for the formation of the respective Rule is not required for an action.

The conditions are according to the ones indicated in the vertical columns Rules r1 to r5 for actions al to a4 for the actuation of actuators or Display links linked. The rules correspond to conjunctive links of the Conditions.

The actions correspond to disjunctive links between the rules.

The following example is given for clarification: The signal J at the condition bl means that the pressure in a vessel has exceeded a predetermined value Has. The signal J in condition b3 indicates that the fuel is being supplied to the heating system of the vessel is running. The signal N in condition b4 indicates that the Kilhlwasserkreislauf is not turned on. The rule r1 connects the conditions bl, b3, b4 conjunctively to an action al, which represents a control command for a valve that controls the fuel supply turns off. However, this valve should also be operated if rule r3 is met is, which conjunctively connects the conditions bl, b2, b3, b4.

Figure 2 shows the principle of the implementation of a decision table into a hard-wired link control including memories and Timers. The signals coming from the process (conditions 5a ... Si), the for example, are supplied by transducers or limit monitors, are in an inverting stage ITV under inverse conditions (5a ...

inverted to ensure active signals for further processing in each case to have available. The signals and the inverted signals become an & matrix supplied undaort according to the rules of the decision table on rules subjunctive connected. The fulfilled rules r solve actions a (commands to the actuators) which either directly and / or via memory M and / or via timing elements T can be issued to the process. Since the same action in general by several Rules can be triggered, the & matrix is followed by a 2 1 matrix. By returning the actions a to the conditions RF, with the same Structure structure also implement sequence controls with branches. For the easier Keeping track of the links can see the conditions and the rules met visual displays, for example light-emitting diodes (LED), are visualized, which preferably have the same structure as the decision table.

About the adaptability to different control tasks A connection-programmable controller according to the invention can ensure this be extensible in terms of conditions, rules and actions.

FIG. 3 shows the principle of an expansion with regard to the conditions. A first & -matrix A is linked to a second & -matrix B in such a way that that at the left inputs of the & matrix A a first number of conditions b1 to b4 and at the left inputs of the & matrix B a further number of Conditions b5 to b7 are pending. The horizontal lower outputs of the & matrix A are connected to the horizontal or horizontal inputs of the & matrix B. The horizontal ones Lower outputs of the & -ltatrix B are assigned to the fulfilled rules r1 to r6.

FIG. 4 shows the principle of an expansion with regard to the rules. A first & matrix A has a further & matrix B and a> 1 matrix A linked. The & -matrix 3 and the 2 1-matrix A are with another # 1 matrix B linked.

The left inputs of the & matrix A are subject to the conditions bl occupied to b4. The horizontal lower outputs of the & matrix A are connected to the upper horizontal inputs of the # 1 matrix A connected. The right outputs of the # 1 matrix A are connected to the left inputs of # 1 matrix B. The right ones Outputs of the & matrix A are connected to the left inputs of the & matrix B. The lower outputs of the & matrix B are connected to the upper inputs of the # 1 matrix B connected. These inputs of the 21 matrix B represent the for an extension of the Rules occupied # 1 inputs. The right outputs of the # 1 matrix B are with occupied by actions a1 to a4.

FIG. 5 shows the principle of an expansion with regard to the actions. A first # 1 matrix A is followed by a second # 1 matrix B. The horizontal ones The upper inputs of the first 2n matrix A are filled with rules r1 to r6. The lower horizontal outputs of the> 1 matrix A are connected to the upper inputs the second # 1 matrix B. At the right exits of the first matrix A appear the actions a1 to a4 and at the right outputs of the second> 1 matrix B actions a5 to a8 appear.

With the help of the expansion options shown in FIGS. 3, 4 and 5 it is possible to program any control tasks.

FIG. 6 shows the interaction in a spatial structural representation an & matrix with a # 1-} matrix from Figure 2.

In the & matrix, the conductor tracks are divided into individual sections. This ensures that the matrix conductor occupied by a condition is connected to the required position can be separated and occupied for a new condition. This significantly reduces the amount of electronics required, but above all the Amount of inputs required for logical functions. An arrangement chosen in this way allows all conditions in one unsorted to a certain extent to the matrix block, since the routing takes place within the flatrix block. The matrices shown separately in FIG. 6 form in practical implementation a unified three-dimensional connecting element, so that a bypassing of Functions can be performed easily.

A suitable three-dimensional connecting element is in the patent application P 27 42 534.9. The use of FPLA modules (Field Programmable Logic Array) is possible (elektronik industrie, 1976, pages 243 to 244).

6 figures 1 claim

Claims (1)

Patent claim Connection programmable control with logical Function modules, not shown in a matrix-like arrangement the logical function module and one programmable by means of decision tables three-dimensional connection matrix.