Imperative process algebra and models of parallel computation

DOI10.1007/S00224-024-10164-0MaRDI QIDQ6580081zbMATH OpenFDO

Authors C. A. Middelburg

Publication date 29 July 2024

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-024-10164-0

zbMATH Keywords

parallel random access machineparallel time complexityimperative process algebraparallel computational thesis

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Imperative process algebra with abstraction
• Parallel models of computation: An introductory survey
• Algebraic-grammatical models of parallel computation
• Models and languages for description of parallel processes
• Models of computation

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1049169 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)
• scientific article; zbMATH DE number 1368948 (Why is no real title available?)
• scientific article; zbMATH DE number 7453962 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• A Model for Asynchronous Shared Memory Parallel Computation
• A complexity theory of efficient parallel algorithms
• A formalization of multi-tape Turing machines
• A process algebra for wireless mesh networks
• A theory of computer instructions
• A universal interconnection pattern for parallel computers
• ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
• CSP with Hierarchical State
• Communicating processes with value-passing and assignments
• Global renaming operators in concrete process algebra
• Imperative process algebra with abstraction
• Inversive meadows and divisive meadows
• Mechanised computability theory
• Mechanising Turing machines and computability theory in Isabelle/HOL
• Parallelism Always Helps
• Parallelism in random access machines
• Process Algebra
• Process algebra for synchronous communication
• Simulation of Parallel Random Access Machines by Circuits
• The abstract variable-binding calculus
• The rational numbers as an abstract data type
• Time bounded random access machines

Cited in

(1)

• Imperative process algebra with abstraction

This page was built for publication: Imperative process algebra and models of parallel computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580081)