Skip to main content

Networks of real-time processes

  • Conference paper
  • First Online:
CONCUR'93 (CONCUR 1993)

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

Included in the following conference series:

Abstract

The input-output function computed by a network of asynchronous real-time processes is proved to be identical to the unique fixed point of a network functional even though the components of the network may compute nonmonotonic functions. The techniques used are those of contractive functions on metric spaces rather than the usual Scott continuity on partial orders. Thus a well-known principle of Kahn is extended to an important model of parallel systems that has been resistant to the traditional approach using Scott continuity.

This document was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor the University of California nor any of their employees, makes any warranty, expressed or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial products, process, or service by trade name, trademark, manufacturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or the University of California. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or the University of California, and shall not be used for advertising or other product endorsement. This work was supported (in part) by the Applied Mathematics Program of the Office of Energy Research (U.S. Department of Energy) under contract No. W-7405-Eng-48 to Lawrence Livermore National Laboratory.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Broy. Nondeterministic data flow programs: How to avoid the merge anomaly. Science of Computer Programming, 10:65–85, 1988.

    Article  Google Scholar 

  2. G. Kahn. The semantics of a simple language for parallel processing. In Information Processing 74, pages 471–475, 1974.

    Google Scholar 

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

    Article  Google Scholar 

  4. J. Misra. Equational reasoning about nondeterministic processes. Formal Aspects of Computing, 2:167–195, 1990.

    Article  Google Scholar 

  5. P. Panangaden. Abstract interpretation and indeterminacy. In S. D. Brookes, A. W. Roscoe, and G. Winskel, editors, Proc. of the Seminar on Concurrency, pages 497–511. Springer-Verlag, LNCS-197, 1985.

    Google Scholar 

  6. D. Park. The fairness problem and nondeterministic computing networks. In J.W. de Bakker and J. van Leeuwen, editors, Foundations of Computer Science IV, Part 2, pages 133–161. Mathematical Centre, Tract #159, 1983.

    Google Scholar 

  7. G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249–261, 1988.

    Article  Google Scholar 

  8. R.K. Yates. Semantics of timed dataflow networks. PhD thesis, McGill University, 1992.

    Google Scholar 

  9. R.K. Yates and G.R Gao. A Kahn principle for networks of nonmonotonic realtime processes. In Proceedings of PARLE '93, Parallel Architectures and Languages Europe. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yates, R.K. (1993). Networks of real-time processes. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-57208-2_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57208-4

  • Online ISBN: 978-3-540-47968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics