The algebra of stream processing functions
From MaRDI portal
Publication:5941194
DOI10.1016/S0304-3975(99)00322-9zbMath0973.68172OpenAlexW2137902021MaRDI QIDQ5941194
No author found.
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00322-9
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
A formally grounded software specification method ⋮ Imperative abstractions for functional actions ⋮ Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems ⋮ The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits ⋮ CPO semantics of timed interactive actor networks ⋮ Asynchronous stream processing with S-Net ⋮ A domain-specific language for cryptographic protocols based on streams ⋮ Algebraic specification of reactive systems ⋮ A Formal Framework for Interactive Agents
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of finite and infinite networks of concurrent communicating agents
- On flowchart theories. I. The deterministic case
- Nondeterministic data flow programs: How to avoid the merge anomaly
- On flowchart theories. II: The nondeterministic case
- Automata Studies. (AM-34)
- A fixpoint semantics for nondeterministic data flow
- Varieties of Iteration Theories
- Equational axioms for regular sets
- Network algebra for asynchronous dataflow∗
- Towards a complete hierarchy of compositional dataflow models
This page was built for publication: The algebra of stream processing functions
