SAT-solving in CSP trace refinement (Q436423)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6059161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SAT-solving in CSP trace refinement |
scientific article; zbMATH DE number 6059161 |
Statements
SAT-solving in CSP trace refinement (English)
0 references
20 July 2012
0 references
CSP
0 references
FDR
0 references
concurrency
0 references
process algebra
0 references
SAT-solving
0 references
bounded model checking
0 references
\(k\)-induction
0 references
safety properties
0 references
0 references
0.8855289
0 references
0.88235736
0 references
0.88146937
0 references
0.8814157
0 references
0.8791946
0 references
0.8764461
0 references
