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

Authors:
A. Thayse
Affiliations:
Philips Research Laboratory
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 8
Cited 2

Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

Journal of the ACM (JACM)
Petri Nets

ACM Computing Surveys (CSUR)
Digital Systems with Algorithm Implementation

Digital Systems with Algorithm Implementation
Synthesis and Optimization of Programs by Means of P-Functions

IEEE Transactions on Computers
A Matrix Formalism for Asynchronous Implementation of Algorithms

IEEE Transactions on Computers
Binary Decision Diagrams

IEEE Transactions on Computers
Synthesis of Minimal Binary Decision Trees

IEEE Transactions on Computers
Parallel program schemata

Journal of Computer and System Sciences

Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity

IEEE Transactions on Computers
A General Model for Memory-Based Finite-State Machines

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

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.