Skip to main content

Elements for the formal description of systems

  • Chapter
  • First Online:

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

Abstract

This paper is an introductory overview of some key concepts that constitute a theoretical basis for the formal description of systems. Following a brief discussion of the criteria determining the usefulness of such concepts for system analysis and design, this overview addresses formal languages and automata, language semantics (with illustrations in trace theory and formal logic), abstract data types and functional formalisms. For what concerns the latter topic, special attention is given to the transformational style of reasoning and to the suitability for describing various kinds of systems. A more complete treatment of the functional approach and its applications is given in two companion papers.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.P. Barendregt, The lambda calculus: its syntax and semantics. North Holland, Amsterdam (1981)

    Google Scholar 

  2. J.A. Bergstra, J.W. Klop, "Algebra of communicating processes", in: J.W. de Bakker et al., eds., Proc. CWI Symposium on Mathematics and Computer Science. CWI, Amsterdam (1985)

    Google Scholar 

  3. R.T. Boute, "Towards a theory of system semantics — an introductory overview of the key concepts for telecommunication engineers". Report RTB-8011, Bell Telephone Mfg. Cy., Antwerpen (Nov. 1980).

    Google Scholar 

  4. R.T. Boute, "System semantics applied to digital and analog circuits". Report No 56, Dept. of Computer Science, University of Nijmegen (Aug. 1984).

    Google Scholar 

  5. R.T. Boute, "On the equivalence of time-divisin and frequency-division multiplexing". IEEE Comm 33, 1, pp. 97–99 (Jan. 1985).

    Google Scholar 

  6. R.T. Boute, "Functional temporal calculus versus temporal logic: an engineering approach". Report No. 59, Dept. of Computer Science, University of Nijmegen (March 1985).

    Google Scholar 

  7. R.T. Boute, "An introduction to system semantics", in: A. Kündig, ed., New Approaches to the Formal Description and the Design of Embedded Systems.

    Google Scholar 

  8. R.T. Boute, "Current research topics in the functional approach to system description", in: A. Kündig, ed., New Approaches to the Formal Description and the Design of Embedded Systems.

    Google Scholar 

  9. J.C. Cleaveland, R.C. Uzgalis, Grammars for programming languages. Elsevier Programming Languages Series No. 4. Amsterdam (1977).

    Google Scholar 

  10. W.F. Clocksin, C.S. Mellish, Programming in Prolog. Springer, Berlin (1981).

    Google Scholar 

  11. H.B. Curry, R. Feys, Combinatory logic. North-Holland, Amsterdam (1974).

    Google Scholar 

  12. M.C.J.D. van Eekelen, M.J. Plasmeijer, "Specification of reduction strategies in a TRS", Internal report, Dept. of Computer Science, University of Nijmegen (Jan. 1986).

    Google Scholar 

  13. J.A. Goguen et al., "An initial algebra approach to the specification, correctness and implementation of abstract data types", in: R.T. Yeh, ed., Current trends in programming methodology, vol IV: data structuring, pp. 80–149. Prentice-Hall, Englewood Cliffs, N.J. (1978)

    Google Scholar 

  14. M.A. Harrison, Introduction to formal language theory. Addison-Wesley, Reading, Mass. (1978).

    Google Scholar 

  15. J. Heering, P. Klint, "User definable syntax for specification languages". Proc. NGI-SION 1986 Symposium, pp. 63–73 (April 1986).

    Google Scholar 

  16. A. Kaldewaij, A formalism for concurrent processes. Ph. D. Thesis, Eindhoven University of Technology (May 1986).

    Google Scholar 

  17. J.W. Klop, "Term Rewriting Systems", Seminar on reduction machines, Ustica (Sept. 1985).

    Google Scholar 

  18. C.H.A. Koster, "Affix grammars", in: J.E.L. Peck, ed., Algol 68 implementation, pp. 95–109. North-Holland Publ. Co., Amsterdam (1971).

    Google Scholar 

  19. M. Levin, "Mathematical logic for computer scientists". Report MAC TR-131. Massachusetts Institute of Technology (June 1974).

    Google Scholar 

  20. H. Meijer, Programmar: a translator generator. Ph. D. Thesis, Dept. of Computer Science, University of Nijmegen (June 1986).

    Google Scholar 

  21. E. Mendelson, Introduction to mathematical logic, 2nd ed. Van Nostrand, New York (1979).

    Google Scholar 

  22. R. Milner, A calculus of communicating systems (LNCS 92). Springer, Berlin (1980).

    Google Scholar 

  23. S.L. Peyton Jones, "Functional programming languages as a software engineering tool", in: A Kündig, ed., New Approaches to the Formal Description and the Design of Embedded Systems.

    Google Scholar 

  24. M. Rem, "Concurrent computations and VLSI circuits", in: M. Broy, ed., Control flow and data flow: concepts of distributed programming, pp. 399–437. Springer, Berlin (1985).

    Google Scholar 

  25. J.G. Sanderson, The lambda calculus, lattice theory and reflexive domains, Mathematical Institute Lecture Notes, University of Oxford (1973).

    Google Scholar 

  26. T.A. Standish, "Data structures — an axiomatic approach", in: R.T. Yeh, ed., Current trends in programming methodology, vol IV:data structuring, pp. 30–59. Prentice-Hall, Englewood Cliffs, N.J. (1978).

    Google Scholar 

  27. J.E. Stoy, Denotational semantics: the Scott-Strachey approach to programming language theory. The MIT Press, Cambridge, Mass. (1977).

    Google Scholar 

  28. D.A. Turner, SASL language manual (revised version). University of Kent (1979).

    Google Scholar 

  29. D.A. Turner, "Miranda: a non-strict functional language with polymorphic types", in: J.P. Jouannand, ed., Functional programming languages and computer architecture, pp. 1–16. LNCS 201, Springer, Berlin (1985).

    Google Scholar 

  30. N. Wirth, "What can we do about the unnecessary diversity of notation for syntactic definitions?", Comm. ACM 20, 11, pp. 822–823 (Nov. 1977).

    Article  Google Scholar 

  31. W.A. Wulf, R.L. London, M. Shaw, "An introduction to the construction and verification of Alphard programs", IEEE SE-2, 4, pp. 253–265 (Dec. 1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Kündig R. E. Bührer J. Dähler

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Boute, R.T. (1987). Elements for the formal description of systems. In: Kündig, A., Bührer, R.E., Dähler, J. (eds) Embedded Systems. Lecture Notes in Computer Science, vol 284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016347

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48021-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics