Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Sheiber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM J.Comput. 17(6), 1253–1262 (1988)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Ramalingam, G.: Bounded Incremental Computation. LNCS, vol. 1089. Springer, Heidelberg (1996)
Welch, J.T.: The clause counter map: An event chaining algorithm for online programmable logic. IEEE Trans. on Robotics and Automation 2 (1995)
Vyatkin, V.: Optimal Algorithms of Event-driven Re-evaluation of Boolean Functions. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 55–63. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vyatkin, V. (2004). Event-Driven Traversal of Logic Circuits for Re-evaluation of Boolean Functions in Reactive Systems. In: Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2003. Lecture Notes in Computer Science, vol 2890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39866-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-39866-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20813-6
Online ISBN: 978-3-540-39866-0
eBook Packages: Springer Book Archive