Analog network testability measurement: a symbolic formulation approach

A symbolic formulation approach is applied to the problem of computing testability features of analog linear networks. The program, SAPTES, obtained by following this approach is presented. The program can be a very useful tool for designers and researchers in the field of linear analog circuits. SAPTES, which is written in LISP and runs on MS-DOS personal computers, is able to compute the testability of linear circuits of rather high complexity (composed of tens of components and nodes). Computational times range from a few tens of seconds to some tens of minutes on medium speed computers. The program is easily transportable to workstations or a mainframe, and, for the mainframe, program performance will considerably increase.<
>