scientific article; zbMATH DE number 3493844
From MaRDI portal
Publication:4076730
Cited in
(20)- A theory for nondeterminism, parallelism, communication, and concurrency
- Specification and top-down design of distributed systems
- Relevance of network theory to models of distributed/parallel processing
- Data flow analysis of program nets
- Clocks in dataflow languages
- Aspects of parallelism in computer architecture
- A high-level dataflow system
- Primitives for resource management in a demand-driven reduction model
- Execution termination and computation determinacy of data-flow program nets
- On Metapaths in Metagraphs
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
- The algebra of stream processing functions
- A method of computing minimum firing time for self-cleaning SWITCH-less program nets
- Specification and verification of concurrent systems by causality and realizability
- On the power of recursion in dataflow schemes
- Coinductive streams in monoidal categories
- RNA: R1CS normalization algorithm based on data flow graphs for zero-knowledge proofs
- A calculus for the specification, design, and verification of distributed concurrent systems
- CPO semantics of timed interactive actor networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076730)
