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

Authors:
Valeriy Vyatkin
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 4
Cited 0

Supervisory control of a class of discrete event processes

SIAM Journal on Control and Optimization
Incremental evaluation of computational circuits

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Bounded Incremental Computation

Bounded Incremental Computation
Binary Decision Diagrams

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.