Abstract
This book has described Boolean reasoning techniques for multi-level combinational networks. In the past, a lot of research on Boolean reasoning has been conducted in the domain of two-level circuit theory. We extended the basic concept of “prime implicant” to multi-level Boolean networks and introduced AND/OR reasoning graphs for calculating these generalized prime implicants. As a special case, an implicant can consist of a single literal. Such single-literal implicants are commonly referred to as “implications” between signal values at network nodes and can be determined by a specialized AND/OR reasoning technique called recursive learning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kunz, W., Stoffel, D. (1997). Conclusions and Future Work. In: Reasoning in Boolean Networks. Frontiers in Electronic Testing, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2572-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2572-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5176-2
Online ISBN: 978-1-4757-2572-8
eBook Packages: Springer Book Archive