Implementation of finite-memory machines within CAST:FSM

  • Alfred Spalt
General CAST Methodology
Part of the Lecture Notes in Computer Science book series (LNCS, volume 410)


This paper shows by means of an example how special system types are implemented within CAST:FSM. CAST:FSM is an interactive method bank which has been developed at the institute of systems sciences at the University of Linz/Austria to support working with finite-state machines. It is implemented in Interlisp-D and LOOPS, an AI programming environment running on SIEMENS 5815 workstations (equivalent to XEROX 1108). Here we discuss a special class of finite-state machines, the class of finite-memory machines. The theory of finite-memory machines can be looked up in literature, whereas an implementation in Interlisp-D/LOOPS within CAST:FSM is described in this paper. We show how the class hierarchy of LOOPS facilitates to conveniently implement both system types (e.g., finite-memory machines) and system transformations (e.g., finite-memory realization of finite-state machines). Some ideas for practical applications conclude our presentation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. Literature

  1. [Booth 67]
    Booth, Taylor L. Sequential Machines and Automata Theory John Wiley and Sons, New York 1967Google Scholar
  2. [BoSt 83]
    Bobrow, D. G., M. J. Stefik The LOOPS Manual Xerox Corporation, Palo Alto, CA 1983Google Scholar
  3. [Gill 62]
    Gill, Arthur Introduction to the Theory of Finite-State Machines McGraw-Hill, New York 1962Google Scholar
  4. [Kohavi 70]
    Kohavi, Zvi Switching and Finite Automata Theory McGraw-Hill, New York 1970Google Scholar
  5. [Pichler 75]
    Pichler, Franz R. Mathematische Systemtheorie Walter de Gruyter, Berlin, New York 1975Google Scholar
  6. [Pichler 88a]
    Pichler, Franz R. “CAST — Computer Aided Systems Theory: A framework for interactive method banks” in: R. Trappl (ed.), Cybernetics and Systems '88 Kluwer Academic Publishers, 1988, pp. 731–736Google Scholar
  7. [Pichler 88b]
    Pichler, Franz R. Konstruktion korrelationsimmuner Schaltfunktionen und Schaltwerke mittels Walsh-Fourieranalyse in: D. Dorninger, et al. (ed.) Contributions to General Algebra, Band 6, Hölder — Pichler — Tempsky, Wien, B. G. Teubner, Stuttgart 1988, pp. 213–222Google Scholar
  8. [PiPr 88]
    Pichler, F. R., H. Prähofer CAST:FSM — Computer Aided Systems Theory:Finite-State Machines in: R. Trappl (ed.), Cybernetics and Systems '88 Kluwer Academic Publishers, 1988Google Scholar
  9. [PiSch 89]
    Pichler, F. R., H. G. Schwärtzel CAST — Computerunterstützte Systemtheorie Springer Verlag, Berlin (to appear 1989)Google Scholar
  10. [Prähofer 86]
    Prähofer, Herbert LOOPS-Implementierung automatentheoretischer Methoden für “Design for Testability” Anwendungen Masters Thesis, Institute of Systems Sciences, University of Linz, Austria 1986Google Scholar
  11. [WiPa 83]
    Williams, T. W., K. P. Parker “Design for Testability — A Survey” in: IEEE Proceedings of the IEEE Vol. 71, No. 1, January 1983, pp. 98–112Google Scholar
  12. [Teitelman 83]
    Teitelman, W., et al. Interlisp Reference Manual Xerox Corp., Palo Alto 1983Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Alfred Spalt
    • 1
  1. 1.Institute of Systems SciencesUniversity LinzLinzAustria

Personalised recommendations