This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
October 1984 (vol. 33 no. 10)
pp. 861-868
A. Thayse, Philips Research Laboratory
A formalism has been introduced for program description and synthesis, namely the matrix description of instructions. In this paper we put that formalism to work by associating with it computation methods based on a generalized P-function concept. Algorithms are derived for the optimal implementation of programs in asynchronously organized structures.
Index Terms:
switching theory, Algorithmic state machines, factorization of Boolean matrices, implementation of algorithms, microprogrammed structures, parallel program schemata, Petri nets, P-functions
Citation:
A. Thayse, "Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept," IEEE Transactions on Computers, vol. 33, no. 10, pp. 861-868, Oct. 1984, doi:10.1109/TC.1984.1676347
Usage of this product signifies your acceptance of the Terms of Use.