Representation matrices for U(4)

We propose an algorithm for the numerical calculation of matrix elements of general U(4) group elements, applicable to large totally symmetric representations of U(4). A possible generalization to the U(6) case is pointed out

Drawing execution graphs by parsing

In this paper we present an algorithm for drawing execution graphs. Such graphs represent the control flow in a program. The fact that a program is con-structed according to a grammar is reflected in the corresponding execution graph. Therefore, we intro-duce graph production rules that are based on gener-ally used programming language constructs. Each rule is applied to a certain class of topologies of the graph. By parsing an execution graph according to these rules a visually appealing layout of the graph can be gener-ated. We take into account that the nodes in a graph can have variable sizes.

A taxonomy for distributed object-oriented real-time systems

This paper gives a taxonomy for the evaluation of object-oriented design methods and implementation languages for the construction of distributed real-time systems. This taxonomy is aimed at answering the following main questions: (1) how well do current approaches support the design of non-functional system features like concurrency and the specification of allocation, timing and fault tolerance constraints and (2) how can we discern essential properties of such methods and languages in order to point out the strengths and weaknesses of contemporary approaches