Skip to main content
SpringerLink
Log in

A Kahn principle for networks of nonmonotonic real-time processes

  • Paper Sessions
  • Conference paper
  • First Online:
PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

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

Abstract

We show that the input-output function computed by a network of asynchronous real-time processes is denoted by the unique fixed point of a Scott continuous functional even though the network or its components may compute a discontinuous function. This extends a well known principle of Kahn to an important class of parallel systems that has resisted the traditional fixed point approach.

Work done while author Yates was a student at McGill University.

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. R. Alur and D. Dill. The theory of timed automata. In J.W. deBakker, C. Huizing, W.P deRoever, and G. Rozenberg, editors, Real-Time: Theory in Practice, pages 45–73. Springer-Verlag, LNCS 600, 1991. Proceedings of the REX Workshop.

    Google Scholar 

  2. F. Boussinot. Proposition de sémantique dénotationelle pour des réseaux de processus avec operateur de mélange équitable. Theoretical Computer Science, 18:173–206, 1982.

    Article  Google Scholar 

  3. J. D. Brock and W. B. Ackerman. Scenarios: A model of non-determinate computation. In J. Diaz and I. Ramos, editors, International Colloquium on Formalization of Programming Concepts, pages 252–259. Springer-Verlag, LNCS-107, 1981.

    Google Scholar 

  4. E. Harel, O. Lichtenstein, and A. Pnueli. Explicit clock temporal logic. In Proc. of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 402–413, 1990.

    Google Scholar 

  5. T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In J.W. deBakker, C. Huizing, W.P deRoever, and G. Rozenberg, editors, Real-Time: Theory in Practice, pages 226–251. Springer-Verlag, LNCS 600, 1991. Proceedings of the REX Workshop.

    Google Scholar 

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

    Google Scholar 

  7. P. Kearney and J. Staples. An extensional fixed-point semantics for nondeterministic data flow. Theoretical Computer Science, 91:129–179, 1991.

    Google Scholar 

  8. R. M. Keller. Denotational models for parallel programs with indeterminate operators. In E. J. Neuhold, editor, Formal Descriptions of Programming Concepts, pages 337–365, Amsterdam, 1978. North-Holland.

    Google Scholar 

  9. R. Koymans. Specifying real-time properties with metric temporal logic. Real Time Systems, 2(4):255–291, 1990.

    Google Scholar 

  10. 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 

  11. M. Merritt, F. Modugno, and M.R. Tuttle. Time-constrained automata. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of Concur '91, pages 408–423. Springer-Verlag, LNCS 527, 1991.

    Google Scholar 

  12. F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of Concur '90, pages 401–415. Springer-Verlag, LNCS 458, 1990.

    Google Scholar 

  13. 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 

  14. P. Panangaden and E. W. Stark. Computations, residuals and the power of indeterminacy. In T. Lepisto and A. Salomaa, editors, Proc. of the Fifteenth International Colloquium on Automata Languages and Programming, pages 348–363. Springer-Verlag, LNCS-317, 1988.

    Google Scholar 

  15. 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 

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

    Article  Google Scholar 

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

    Google Scholar 

  18. R.K. Yates. Networks of real-time processes. Submitted for publication, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lawrence Livermore National Laboratory, P.O. Box 808, 94551, Livermore, CA, USA

    Robert Kim Yates

  2. School of Computer Science, McGill University, 3480 University St, H3A 2A7, Montreal, Quebec, Canada

    Guang Rong Gao

Authors
  1. Robert Kim Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guang Rong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yates, R.K., Gao, G.R. (1993). A Kahn principle for networks of nonmonotonic real-time processes. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation