Skip to main navigation Skip to search Skip to main content

Stability and sequentiality in dataflow networks

  • Cornell University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

The class of monotone input/output automata has been shown in the authors' previous work to be a useful operational model for dataflow-style networks of communicating processes. An interesting class of problems arising from this model are those that concern the relationship between the input/output behavior of automata to the structure of their transition graphs. In this paper, we restrict our attention to the subclass of determinate automata, which compute continuous functions, and we characterize classes of determinate automata that compute: (1) the class of functions that are stable in the sense of Berry, and (2) the class of functions that are sequential in the sense of Kahn and Plotkin.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - l7th International Colloquium, Proceedings
EditorsMichael S. Paterson
PublisherSpringer Verlag
Pages308-321
Number of pages14
ISBN (Print)9783540528265
DOIs
StatePublished - 1990
Event17th International Colloquium on Automata, Languages and Programming, 1990 - Warwick, United Kingdom
Duration: Jul 16 1990Jul 20 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume443 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Colloquium on Automata, Languages and Programming, 1990
Country/TerritoryUnited Kingdom
CityWarwick
Period07/16/9007/20/90

Fingerprint

Dive into the research topics of 'Stability and sequentiality in dataflow networks'. Together they form a unique fingerprint.

Cite this