Skip to main content

What can we learn from synchronous data-flow languages?

Invited presentation

  • Invited Talk
  • Conference paper
  • First Online:
Hybrid and Real-Time Systems (HART 1997)

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

Included in the following conference series:

Abstract

In this talk we try to explain why synchronous data-flow languages have been successful in programming critical control systems. A tentative explanation is that these languages have their background in both computer and control sciences. This supports our opinion that such a common background would be useful for other related topics, for instance formal methods and distributed programming. Furthermore, we believe that computer based control of critical systems requires engineers trained in both sciences, and finding such engineers is difficult. A common cultural background, which the hybrid community tries to establish, may help in this issue.

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. J.-R. Abrial. The B-Book. Cambridge University Press, 1995.

    Google Scholar 

  2. E. A. Ashcroft and W. W. Wadge. Lucid, the data-flow programming language. Academic Press, 1985.

    Google Scholar 

  3. A. Benveniste and P. LeGuernic. Hybrid dynamical systems theory and the signal language. IEEE Transactions on Automatic Control, 35(5):535–546, 1990.

    Google Scholar 

  4. G. Berry and G. Gonthier. The Esterel synchronous programming language, design, semantics, implementation. Science of Computer Programming, 19(2):87–152, 1992.

    Google Scholar 

  5. D. Brière, D. Ribot, D. Pilaud, and J.L. Camus. Methods and specification tools for Airbus on-board systems. In Avionics Conference and Exhibition, London, December 1994. ERA Technology.

    Google Scholar 

  6. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language Lustre. Proceedings of the IEEE, 79(9):1305–1320, September 1991.

    Google Scholar 

  7. D. Harel and A. Pnueli. On the development of reactive systems. In Logic and Models of Concurrent Systems, volume 13 of NATO ASI Series, pages 477–498. Springer Verlag, 1985.

    Google Scholar 

  8. G. Kahn. The semantics of a simple language for parallel programming. In IFIP 74 Congress. North Holland, Amsterdam, 1974.

    Google Scholar 

  9. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, 1994.

    Google Scholar 

  10. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Google Scholar 

  11. S. Owre, J. Rushby, and N. Shankar. PVS: a prototype verification system. In 11th Conf. on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 748–752. Springer Verlag, 1992.

    Google Scholar 

  12. A. Pnueli. The temporal logic of programs. In 18th Symp. on the Foundations of Computer Science. IEEE, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Oded Maler

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caspi, P. (1997). What can we learn from synchronous data-flow languages?. In: Maler, O. (eds) Hybrid and Real-Time Systems. HART 1997. Lecture Notes in Computer Science, vol 1201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014730

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62600-8

  • Online ISBN: 978-3-540-68330-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics