Sequential Boolean Equations
Shimon Even, Albert R. Meyer · IEEE Transactions on Computers · 1969
The problem of solving sequential Boolean equations is shown to be equivalent to the problem of finding whether there exists a path on a labeled graph for every sequence of labels. Algorithms are given for testing whether a solution exists, and if a solution with a finite delay exists. In case of existence of solutions the algorithms provide them.