Java Quine McCluskey implements the Quine McCluskey algorithm with Petrick’s Method (or the method of prime implicants) for minimization of Boolean functions. This software can be used both for learning and solving real problems. As learning/teaching tool it presents not only the results, but also how the problem was solved as well as how to use Karnaugh Maps to solve the problem.
Up to sixteen functions of sixteen variables can be minimized. A graphical interface is provided for entering and editing the truth table that can be saved and loaded. The results can be exported in HTML format. It generates the Karnaugh Map for educational purpose and the actual truth table from the obtained expressions even when multiple solutions for each function are found.
This implementation supports PLC programming, so results can be presented in many forms including Structured Text (ST) and Ladder Diagram (LD) along conventional Boolean expression.
You’re probably paying too much for cell phone service. Wirefly compares hundreds of plans to help you save. Enter what you need (minutes, data, texts) into Wirefly’s innovative plan comparison tools and see your savings instantly.
Website | https://jqm-java-quine-mccluskey.sourceforge.io |
Tags | Computer Aided Instruction (CAI)Electronic Design Automation (EDA)SCADA |
License | GNU General Public License version 3.0 (GPLv3) |
Platform | Linux Mac Windows |
Features |
|