Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept

DOI10.1109/TC.1984.1676347zbMath0546.68031OpenAlexW2094336792MaRDI QIDQ3336693

André Thayse

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.1676347

zbMATH Keywords

Petri netsimplementation of algorithmsalgorithmic state machinesmatrix description of instructionsparallel program schematafactorization of Boolean matricesasynchronously organized structuresgeneralized P-functionmicroprogrammed structures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (1)

P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms

This page was built for publication: Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept