Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2001)

Part of the book series: Lecture Notes in Computer Science ((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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. C.E. Shannon. A symbolic analysis of relay and switching circuits. Trans. AIEE, 57:713–723, 1938.

    Google Scholar 

  3. Ramalingam G. Bouded Incremental Computation, volume 1089 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1996.

    Book  Google Scholar 

  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. 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.

    Article  MATH  MathSciNet  Google Scholar 

  6. S.B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27:509–16, 1978.

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Dept. of Engineering Science, Martin Luther University of Halle-Wittenberg, D-06099, Halle, Germany

    Valeriy Vyatkin

Authors
  1. Valeriy Vyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Informatics and Mathematical Modelling, Technical University of Denmark, Bldg.322, 106-108, Richard Petersens Plads, 2800, Lyngby, Denmark

    Dines Bjørner

  2. Computer Science Department, Technical University of Munich, Arcisstr.21, 80290, Munich, Germany

    Manfred Broy

  3. A.P.Ershov Institute of Informatics Systems, Acad.Lavrentjev ave.,6, 630090, Novosibirsk, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vyatkin, V. (2001). Optimal Algorithms of Event-Driven Re-evaluation of Boolean Functions. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45575-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45575-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation