Event-Driven Traversal of Logic Circuits for Re-evaluation of Boolean Functions in Reactive Systems
This paper presents an efficient algorithm for re-evaluation of a Boolean function represented as a logic circuit. The algorithm consists of pre-computation and re-evaluation parts. For a given logic circuit and initial input bits, the pre-computation constructs the data structure for the re-computation. The re-evaluation accepts a list of changed input bits and updates the output of the circuit. The pre-computation runs in time linear to size of the circuit and the re-computation performs in time linear to the number of triggered input bits.
KeywordsBoolean computation Logic circuits Incremental computation
Unable to display preview. Download preview PDF.
- 1.Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, K.: Incremental evaluation of computational circuits. In: Proceedings of First Annual ACM-SIAM symposium on Discrete Algorithms, pp. 32–42 (1990)Google Scholar
- 5.Welch, J.T.: The clause counter map: An event chaining algorithm for online programmable logic. IEEE Trans. on Robotics and Automation 2 (1995)Google Scholar