  In this paper, we present a method of verification of collaborative workflow
processes based on model checking techniques. In particular, we propose to
verify soundness properties of these processes using SPIN model checker. First
we translate the adopted specification of workflows (i.e. the WF-net) to
Promela which is the description language of models to be verified by SPIN.
Then we express the soundness properties in Linear Temporal Logic (LTL) and use
SPIN to test whether each property is satisfied by the Promela model of the
WF-net in question. Finally, we express the properties of k-soundness for
WF-nets modeling multiple instances and (k,R)-soundness for workflow processes
with multiple instances and sharing resources.
