SAT-solving in practice, with a tutorial example from supervisory control
type: Item
instance of: scholarly article
title: SAT-solving in practice, with a tutorial example from supervisory control
zbMATH Open document ID: 1180.93065
author: Koen Claessen
author: Niklas Eén
author: Mary Sheeran
author: Niklas Sörensson
author: Alexey Voronov
author: Knut Åkesson
published in: Discrete Event Dynamic Systems
publication date: 2010-01-18T00:00:00Z
full work available at URL: https://research.chalmers.se/en/publication/98185
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93A13
Mathematics Subject Classification ID: 93C83
zbMATH DE Number: 5659710
zbMATH Keywords: formal verification
zbMATH Keywords: Boolean satisfiability problem
zbMATH Keywords: model checking
zbMATH Keywords: supervisory control
describes a project that uses: UMDES
describes a project that uses: MiniSat
describes a project that uses: SATO
describes a project that uses: Chaff
describes a project that uses: BerkMin
MaRDI profile type: Publication
OpenAlex ID: W2100637096
cites work: Correct Hardware Design and Verification Methods
cites work: Computer Aided Verification
cites work: Q4817533
cites work: Q4553262
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: The complexity of theorem-proving procedures
cites work: Q4551177
cites work: A Computing Procedure for Quantification Theory
cites work: A machine program for theorem-proving
cites work: Optimal speedup of Las Vegas algorithms
cites work: Formal Methods in Computer-Aided Design
cites work: Supervisory Control of a Class of Discrete Event Processes
DOI: 10.1007/S10626-009-0081-8
description: scientific article; zbMATH DE number 5659710