Clocks in dataflow languages
From MaRDI portal
Publication:1185019
DOI10.1016/0304-3975(92)90326-BzbMATH Open0745.68032OpenAlexW2026927717MaRDI QIDQ1185019FDOQ1185019
Authors: Paul Caspi 
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90326-b
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Title not available (Why is that?)
- From regular expressions to deterministic automata
- Transductions des langages de Chomsky
- Title not available (Why is that?)
- A Characterization of Machine Mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- A functional model for describing and reasoning about time behaviour of computing systems
Cited In (9)
- Abstraction of Clocks in Synchronous Data-Flow Systems
- Synchronous structures
- \(N\)-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
- Dependent vector types for data structuring in multirate Faust
- Resource control for synchronous cooperative threads
- Title not available (Why is that?)
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Title not available (Why is that?)
- Scheduling and buffer sizing of n-synchronous systems. Typing of ultimately periodic clocks in Lucy-n
Uses Software
This page was built for publication: Clocks in dataflow languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185019)
