Network algebra for asynchronous dataflow∗

DOI10.1080/00207169708804599zbMath0891.68040arXiv1303.0382OpenAlexW2169298944MaRDI QIDQ4375420

Gheorghe Ştefănescu, Jan A. Bergstra, C. A. Middelburg

Publication date: 4 March 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0382

zbMATH Keywords

asynchronous dataflow networksnetwork algebra

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

A basic algebra of stateless connectors ⋮ Network algebra in Java ⋮ The algebra of stream processing functions

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• Nondeterministic data flow programs: How to avoid the merge anomaly
• On flowchart theories. II: The nondeterministic case
• A fully abstract trace model for dataflow and asynchronous networks
• On sequential composition, action prefixes and process prefix
• Modular specification of process algebras
• Process algebra for synchronous communication
• Process Algebra

This page was built for publication: Network algebra for asynchronous dataflow^∗