Event-driven algorithms of incremental logic computations using generalized decision diagrams

This paper presents a specific class of incremental computations adapted for re-evaluation of logic functions in discrete-event systems. Algorithms are divided onto two parts: a dynamic part, which runs online and computes response for an event, and a pre-computation, which prepares the internal data model for a coming event. The common property of the algorithms is their complexity, bounded rather by some function of the number of changed variables than the total number of the function's arguments.