Skip to main content
SpringerLink
Log in

Stability and sequentiality in dataflow networks

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 443))

Included in the following conference series:

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.

Research supported in part by NSF Grant CCR-8818979.

Research supported in part by NSF Grants CCR-8702247 and CCR-8902215.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(1):1–82, 1988.

    Google Scholar 

  2. M. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987.

    Google Scholar 

  3. G. Berry. Stable models of typed lambda-calculi. In Proceedings of the Fifth International Colloquium on Automata Languages And Programming, pages 72–89, 1978. Springer-Verlag Lecture Notes In Computer Science 62.

    Google Scholar 

  4. G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theoretical Computer Science, 20:265–321, 1982.

    Google Scholar 

  5. P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science, John Wiley and Sons, 1986.

    Google Scholar 

  6. G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74, pages 993–998, North-Holland. 1977.

    Google Scholar 

  7. G. Kahn and G. Plotkin. Structures de données concrètes. Technical Report 336, IRIA-LABORIA, 1978.

    Google Scholar 

  8. M. Kwiatkowska. Fairness for Non-Interleaving Concurrency. PhD thesis, University of Leicester, May 1989.

    Google Scholar 

  9. N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input/output automata. Information and Computation, 82(1):81–92, July 1989.

    Google Scholar 

  10. A. Mazurkiewicz. Trace theory. In Petri Nets: Application and Relation to other Models of Concurrency, pages 279–324, Springer-Verlag, September 1986.

    Google Scholar 

  11. P. Panangaden and V. Shanbhogue. On The Expressive Power of Indeterminate Primitives. Technical Report 87-891, Cornell University, Computer Science Department, November 1987.

    Google Scholar 

  12. P. Panangaden, V. Shanbhogue, and E. W. Stark. Stability and Sequentiality in Dataflow Networks. Technical Report 89–1055, Cornell University Dept. of Computer Science, 1989. (also SUNY at Stony Brook CS Dept. TR-89-27).

    Google Scholar 

  13. P. Panangaden and E. W. Stark. Computations, residuals, and the power of indeterminacy. In Automata, Languages, and Programming, pages 439–454, Springer-Verlag. Volume 317 of Lecture Notes in Computer Science, 1988.

    Google Scholar 

  14. G. Plotkin. Lcf considered a programming language. Theoretical Computer Science, 5(3):223–256, 1977.

    Google Scholar 

  15. M. W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming, North-Holland. 1985.

    Google Scholar 

  16. E. W. Stark. Concurrent transition system semantics of process networks. In Fourteenth ACM Symposium on Principles of Programming Languages, pages 199–210, January 1987.

    Google Scholar 

  17. E. W. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221–269, 1989.

    Google Scholar 

  18. E. W. Stark. Connections between a concrete and an abstract model of concurrent systems. In Mathematical Foundations of Programming Language Semantics, Springer-Verlag. Lecture Notes in Computer Science, 1990. (to appear).

    Google Scholar 

  19. E. W. Stark. On the relations computed by a class of concurrent automata. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 329–340, January 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, NY, USA

    Prakash Panangaden & Vasant Shanbhogue

  2. Department of Computer Science, State University of New York at Stony Brook, 11794, Stony Brook, NY, USA

    Eugene W. Stark

Authors
  1. Prakash Panangaden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vasant Shanbhogue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eugene W. Stark
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panangaden, P., Shanbhogue, V., Stark, E.W. (1990). Stability and sequentiality in dataflow networks. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032041

Download citation

  • DOI: https://doi.org/10.1007/BFb0032041

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation