SAT-solving in practice, with a tutorial example from supervisory control
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1796153 (Why is no real title available?)
- scientific article; zbMATH DE number 1798189 (Why is no real title available?)
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Computer Aided Verification
- Correct Hardware Design and Verification Methods
- Formal Methods in Computer-Aided Design
- Graph-Based Algorithms for Boolean Function Manipulation
- Interpolation and SAT-based model checking.
- Optimal speedup of Las Vegas algorithms
- SAT-solving in practice, with a tutorial example from supervisory control
- Supervisory Control of a Class of Discrete Event Processes
- The complexity of theorem-proving procedures
Cited in
(5)- The possibilistic Horn non-clausal knowledge bases
- Accelerating a continuous-time analog SAT solver using GPUs
- Explaining the \texttt{cumulative} propagator
- Safe PLC Controller Implementation IEC 61131-3 Compliant based on a Simple SAT Solver: Application to Manufacturing Systems
- SAT-solving in practice, with a tutorial example from supervisory control
This page was built for publication: SAT-solving in practice, with a tutorial example from supervisory control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843991)