Deterministic receptive processes are Kahn processes

  • Authors:
  • S. A. Edwards;O. Tardieu

  • Affiliations:
  • Columbia Univ., New York, NY, USA;Columbia Univ., New York, NY, USA

  • Venue:
  • MEMOCODE '05 Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Deterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies the design and validation of such systems and most concurrent formalisms are nondeterministic. This paper connects two of the more successful deterministic asynchronous formalisms: Kahn's dataflow networks and Josephs's deterministic receptive processes. The main result: a divergence-free deterministic receptive process is a Kahn process in that it can be modeled by a continuous function from input to output sequences, thus verifying it is compositionally deterministic. This result provides a bridge between two communities, enabling results from the asynchronous digital hardware community to be used in the context of dataflow computation and vice versa.