This model allows to experiment the importance splitting algorithm. The model consists in a single module that described a chain of n states. At each state it is either possible to continue to the next state with probability p, or to exit the chain with probability 1-p. The property that we check determine the probability to reach the end of the chain. This probability can be easily computed as 
The score function in this model corresponds to the state reached in the chain. For a chain of 10 states, the observer that we use is therefore the following:
Important!
observer chainObserver
score : double init 0;
decided : bool init false;
[] s != 11 & score < s -> (score’=score+1);
[] s>=10 -> (decided’=true);
endobserver
The model file is available here.
