P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms
zbMath0568.68028MaRDI QIDQ1060560
Publication date: 1984
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Boolean functionssynthesis of algorithmshardware implementationsoftware implementationlogic circuitalgebraic model for the representation of algorithmsalgorithmic state machinesasynchronous implementationdiscrete algorithm implementationsfeedback instructionhigh-level instructionslow-level instructionsmatrix description of instructionsparallel flowchartsparallel program schematasafe programssynchronous implementation
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
This page was built for publication: P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms