Index: trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorObserved.java
===================================================================
--- trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorObserved.java	(revision 757)
+++ trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorObserved.java	(revision 766)
@@ -1,5 +1,4 @@
 package de.ugoe.cs.quest.coverage;
 
-import java.security.InvalidParameterException;
 import java.util.Collection;
 import java.util.LinkedHashSet;
@@ -69,5 +68,5 @@
      * @param length
      *            length of the subsequences for which the coverage is analyzed; must be >0
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if observedSequences or sequences is null or length less than or equal to
      *             0
@@ -78,11 +77,11 @@
     {
         if (observedSequences == null) {
-            throw new InvalidParameterException("observed sequences must not be null");
+            throw new IllegalArgumentException("observed sequences must not be null");
         }
         if (sequences == null) {
-            throw new InvalidParameterException("sequences must not be null");
+            throw new IllegalArgumentException("sequences must not be null");
         }
         if (length <= 0) {
-            throw new InvalidParameterException("length must be >0; actual value: " + length);
+            throw new IllegalArgumentException("length must be >0; actual value: " + length);
         }
         this.observedSequences = observedSequences;
@@ -158,10 +157,10 @@
      *            stochastic process which is used to determine which subsequences are possible
      * @return coverage percentage
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if process is null
      */
     public double getCoveragePossibleNew(IStochasticProcess process) {
         if (process == null) {
-            throw new InvalidParameterException("process must not be null");
+            throw new IllegalArgumentException("process must not be null");
         }
         createSubSeqs();
@@ -186,10 +185,10 @@
      *            are possible
      * @return coverage percentage
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if process is null
      */
     public double getCoveragePossibleNewWeight(IStochasticProcess process) {
         if (process == null) {
-            throw new InvalidParameterException("process must not be null");
+            throw new IllegalArgumentException("process must not be null");
         }
         createSubSeqs();
Index: trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorProcess.java
===================================================================
--- trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorProcess.java	(revision 757)
+++ trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/CoverageCalculatorProcess.java	(revision 766)
@@ -1,5 +1,4 @@
 package de.ugoe.cs.quest.coverage;
 
-import java.security.InvalidParameterException;
 import java.util.Collection;
 import java.util.List;
@@ -74,5 +73,5 @@
      * @param length
      *            length of the subsequences for which the coverage is analyzed; must be >0
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if process or sequences is null or length less than or equal to 0
      */
@@ -82,11 +81,11 @@
     {
         if (process == null) {
-            throw new InvalidParameterException("process must not be null");
+            throw new IllegalArgumentException("process must not be null");
         }
         if (sequences == null) {
-            throw new InvalidParameterException("sequences must not be null");
+            throw new IllegalArgumentException("sequences must not be null");
         }
         if (length <= 0) {
-            throw new InvalidParameterException("length must be >0; actual value: " + length);
+            throw new IllegalArgumentException("length must be >0; actual value: " + length);
         }
         this.process = process;
@@ -191,10 +190,10 @@
      * @param newSequences
      *            new collection of sequences
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown is newSequences is null
      */
     public void setSequences(Collection<List<Event>> newSequences) {
         if (newSequences == null) {
-            throw new InvalidParameterException("sequences must not be null");
+            throw new IllegalArgumentException("sequences must not be null");
         }
         this.sequences = newSequences;
Index: trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/SequenceTools.java
===================================================================
--- trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/SequenceTools.java	(revision 757)
+++ trunk/quest-core-coverage/src/main/java/de/ugoe/cs/quest/coverage/SequenceTools.java	(revision 766)
@@ -1,5 +1,4 @@
 package de.ugoe.cs.quest.coverage;
 
-import java.security.InvalidParameterException;
 import java.util.Collection;
 import java.util.LinkedHashMap;
@@ -83,10 +82,10 @@
      *            lenght of the sequences
      * @return numStates^length
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if length less or equal to 0
      */
     public static long numSequences(IStochasticProcess process, int length) {
         if (length <= 0) {
-            throw new InvalidParameterException("length must be a positive integer");
+            throw new IllegalArgumentException("length must be a positive integer");
         }
         long result = 0;
@@ -108,5 +107,5 @@
      *            length of the subsequences
      * @return {@link Set} of all subsequences
-     * @throws InvalidParameterException
+     * @throws IllegalArgumentException
      *             thrown if length less or equal to 0
      */
@@ -115,5 +114,5 @@
     {
         if (length <= 0) {
-            throw new InvalidParameterException("length must be a positive integer");
+            throw new IllegalArgumentException("length must be a positive integer");
         }
         Set<List<Event>> containedSubSeqs = new LinkedHashSet<List<Event>>();
