Optimal Algorithms of Event-Driven Re-evaluation of Boolean Functions

  • Valeriy Vyatkin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2244)

Abstract

In many real-time applications, such as distributed logic control systems, response time is crucial. The response is generated by computation of Boolean functions. In this paper event-driven method of recomputations is suggested to get rid of computation overheads and provide the response in optimal time. New type of decision diagrams called Index Decision Diagrams (IDD for short) is introduced to facilitate such computations. Using IDD the computation of the function is performed in time, linear to the number of non-zero elements in the argument vector. Event-driven recomputation consists of two parts: online recomputation which is proven to have running time linear to the number of changed arguments, and precomputation which prepares the model for the former part in a fixed state of the arguments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Alpern, R. Hoover, B.K. Rosen, P.F Sweeney, and K. Zadeck. Incremental evaluation of computational circuits, pages 32–42. Proceedings of First Annual ACM-SIAM symposium on Discrete Algorithms, 1990.Google Scholar
  2. 2.
    C.E. Shannon. A symbolic analysis of relay and switching circuits. Trans. AIEE, 57:713–723, 1938.Google Scholar
  3. 3.
    Ramalingam G. Bouded Incremental Computation, volume 1089 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1996.CrossRefGoogle Scholar
  4. 4.
    J.H. Christensen. Basic concepts of IEC 61499. In Proc. of Conference “Verteile Automatisieriung” (Distributed Automation), pages 55–62, Magdeburg, Germany, 2000.Google Scholar
  5. 5.
    Ramadge P.J. and Wonham W.M. Supervisory control of a class of discrete event processes. SIAM J Control Optimisation, 25(1):206–230, 1987.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    S.B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27:509–16, 1978.CrossRefGoogle Scholar
  7. 7.
    V. Viatkin, K. Nakano, and T. Hayashi. Optimized Processing of Complex Events in Discrete Control Systems using Binary Decision Diagrams, pages 445–450. Int’l workshop on algorithms and architectures in real-time control, IFAC, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Valeriy Vyatkin
    • 1
  1. 1.Dept. of Engineering ScienceMartin Luther University of Halle-WittenbergHalleGermany

Personalised recommendations