Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
DOI10.1109/TC.1984.1676347zbMATH Open0546.68031OpenAlexW2094336792MaRDI QIDQ3336693FDOQ3336693
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1820087
- A general formulation of asynchronous iterations
- Synthesis of Asynchronous Systems
- M-Functions and Parallel Asynchronous Algorithms
- An algorithmic framework for synthesis of concurrent programs
- Synthesis of distributed algorithms using asynchronous automata.
- scientific article; zbMATH DE number 3990752
- Parallel and distributed algorithms in P systems
- Structured Derivation of Semi-Synchronous Algorithms
- From Asynchronous to Synchronous Specifications for Distributed Program Synthesis
Petri netsimplementation of algorithmsalgorithmic state machinesmatrix description of instructionsparallel program schematafactorization of Boolean matricesasynchronously organized structuresgeneralized P-functionmicroprogrammed structures
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Algorithms in computer science (68W99) Theory of operating systems (68N25)
Cited In (3)
This page was built for publication: Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336693)
