Issue No.04 - April (1984 vol.33)
A. Thayse , Philips Research Laboratory
We show that well-known instructions such as if then else, fork, join, while do, can be represented as row matrices or column-matrices. We define a matrix-instruction which encompasses and generalizes the above instructions. This instruction provides us with a compact tool for describing algorithms and for synthesizing them in synchronous and asynchronous structures. We show, e.g., that the synthesis of a program by means of elementary instructions reduces to the factorization of a matrix into elementary matrices. A formalism and a computation method are introduced which generalize the author's previous work on the subject.
switching theory, Algorithmic state machine, factorization of Boolean matrices, implementation of algorithms, microprogrammed structures, Petri nets, P-functions
A. Thayse, "A Matrix Formalism for Asynchronous Implementation of Algorithms", IEEE Transactions on Computers, vol.33, no. 4, pp. 289-300, April 1984, doi:10.1109/TC.1984.1676434