Frey, G.; Litz, L..:
A Measure for Transparency in Net Based Control Algorithms.
Proceedings of the IEEE SMC'99, 12.-15. Oktober 1999, Tokyo (J). Volume IV, pp. 516-521.

    In contrast to other areas of software design, in control applications the concepts of software quality following ISO/IEC 9126 standard are not very common. However, a primary goal in applying formal methods to controller design is the transparency of the resulting algorithm. A (graphically described) algorithm is said to be transparent if it is "easy and clear to see" what the controller does in the moment and what it will do in the next steps. In this contribution the relation of this transparency concept to software quality is shown. Yet, the definition of transparency is vague and depends mainly on the subjective opinion on what "easy and clear to see" means. There are several aspects of a control algorithm that can be compared on an objective basis. In this paper the ability of different graphical controller design methods - finite automata, Switching Interpreted Petri Nets (SIPN) and Sequential Function Chart (SFC) according to IEC1131 standard - to describe an algorithm in a transparent way is compared. Furthermore, a number of criteria for transparency are given. These criteria cover different aspects such as number of comments, directionality and I/O-behavior. They are combined in a weighted sum to an automatically computable metric.
    The results of the presented method are twofold: First a set of rules for transparent controller design in the framework of SIPN and SFC is derived and secondly a metric which allows the comparison of the transparency of different control algorithms (realizing the same task of course) is achieved. The first result is interesting for the industrial application of the graphical design methods whereas the second result can be used for educational purposes and for optimization.