A general problem in compositional data analysis is the unmixing of a composition into a series of pure endmembers. In its most complex version, one does neither know the composition of these endmembers, nor their relative contribution to each observed composition. The problem is particularly cumbersome if the number of endmembers is larger than the number of observed components. This contribut...

This paper describes a technique of inductive proof based on model checking. It differs from previous techniques that combine induction and model checking in that the proof is fully mechanically checked and temporal variables (process identifiers, for example) may be natural numbers. To prove ∀n.φ(n) inductively, the predicate φ(n − 1) ⇒ φ(n) must be proved for all values of the parameter n. It...

The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parallel processes together. Many techniques have been proposed to overcome this di culty and, thus, increase the size of the systems that model checkers can handle. We describe several compositional model checking techniqu...