Refactor sampling function for uncertainty analysis.
Add tests for NOR and NAND gates as children.
Add test input file with very long minimal cut set.

This case must be reported by dividing the cut set into chunks that fit
into a screen.
Add a test for non-coherent MCUB request.
Use the general gate function for complex top gate expansion.

Previously, top gates were treated in the UnrollGates() function while
the same functionality exists in the general UnrollGate() function.
Add a test for many house event propagation scenarios.
Correct input files for name and definition clash detection.
Add a test for constant gate propagation due to complement basic events.
Add input files that describe the issue #92.

The subtle unity of generated minimal cut sets are not detected and
reported correctly.
Update readme, todo, and documentation with non-coherency and
algorithms.
Add benchmark tests for the Chinese fault tree from XFTA.
Implement a new algorithm for cut set generation.

A new walker algorithm is implemented that is supposed to generate cut
sets from a fault tree faster than the previous algorithms. The
minimality detection is not optimized.
Apply the cut set minimization optimization from the previous algorithm.

The code from the previous algorithm is used to minimize generated cut
sets. This provides a bit of performance improvement.
Decrease non-deterministic performance with the new algorithm. Provide
speed recordings. Fixes #89.

The new algorithm reduces non-determinism in comparison to the previous
implementation of the MOCUS-like algorithm.
Merge branch 'develop' into coverity-scan

Conflicts:
	README.rst
	doc/bugs.rst
	doc/fta_mcs_algorithm.rst
	doc/speedlog.txt
	doc/todo.rst
	input/NotGate/house_unity.xml
	tests/input/fta/def_clash_basic_gate.xml
	tests/input/fta/name_clash_gate_primary.xml