Advertisement

A logic-free method for modular composition of specifications

  • Victor Yodaiken
Data And Software Engineering
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)

Abstract

Clear mathematical description of large scale digital systems is not possible without extensive use of encapsulation. We argue that standard models of concurrency and composition are too unstructured to support modular composition and verification of systems. We offer an alternative model based on algebraic feedback products of finite state machines. We also describe a technique for concisely specifying complex state machines in terms of state dependent (modal) functions. The product automata model provides a precise interpretation for the formal expressions, and the formal expressions provide an intuitive language for describing multi-layer concurrent digital systems. We develop several examples, showing how specifications of varying levels of abstractness can be composed to specify rather complex systems.

Keywords

State Machine Temporal Logic Finite State Machine Proof System Shift Register 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. Apt, editor. Logics and Models of Concurrent Systems. Springer-Verlag, 1985.Google Scholar
  2. [2]
    R. T. Boute. On the shortcomings of the axiomatic approach as presently used in computer science. In Compeuro 88 Systems Design: Concepts Methods, and Tools, 1988.Google Scholar
  3. [3]
    E. M. Clarke, Emerson A., and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. In Proceedings of the 10th Annual Symposium on Principles of Programming Languages, pages 117–119, 1983.Google Scholar
  4. [4]
    J.W. de Bakker, editor. Current Trends in Concurrency. Number 224 in Lecture Notes in Computer Science. Springer-Verlag, 1985.Google Scholar
  5. [5]
    Ferenc Gecseg. Products of Automata. Monographs in Theoretical Computer Science. Springer Verlag, 1986.Google Scholar
  6. [6]
    R. L. Goodstein. Recursive Number Theory. North Holland, Amsterdam, 1957.Google Scholar
  7. [7]
    D. Harel. Logics of programs: Axiomatics and descriptive powers. Technical Report TR-200, MIT/LCS, 1978.Google Scholar
  8. [8]
    C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  9. [9]
    S. Kripke. Semantical considerations on modal logic. Acta Philosophica Fennica, 16:83–94, 1963.Google Scholar
  10. [10]
    E.F. Moore, editor. Sequential Machines: Selected Papers. Addison-Welsey, Reading MA, 1964.Google Scholar
  11. [11]
    J.S. Ostroff and W.M. Wonham. Modelling, specifying, and verifying real-time embedded computer systems. In Symposium on Real-Time Systems, Dec 1987.Google Scholar
  12. [12]
    Rozsa Peter. Recursive functions. Academic Press, 1967.Google Scholar
  13. [13]
    K. Voss, H.J. Genrich, and G Rozenberg, editors. Concurrency and Nets: Advances in Petri Nets. Springer-Verlag, 1987.Google Scholar
  14. [14]
    V. Yodaiken and K. Ramamritham. Axiomatic specification of automata. Technical Report in preparation, University of Massachusetts, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Victor Yodaiken
    • 1
  1. 1.Department of Computer ScienceUniversity of MassachusettsAmherst

Personalised recommendations