We report on a case study in which SAL model checkers have been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion prope...
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in ...
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...