update module descriptions

Author: mtf90

algorithms/active/adt/pom.xml

@@ -29,7 +29,10 @@ limitations under the License.
 
     <artifactId>learnlib-adt</artifactId>
     <name>LearnLib :: Algorithms :: ADT</name>
-    <description>The ADT Algorithm</description>
+    <description>
+        The ADT Algorithm. Uses adaptive distinguishing trees (a generalization of adaptive distinguishing sequences) to
+        separate hypothesis states and focuses on minimizing the amount of resets during the learning process.
+    </description>
 
     <dependencies>
         <!-- LearnLib dependencies -->

algorithms/active/discrimination-tree-vpda/pom.xml

@@ -30,6 +30,10 @@ limitations under the License.
 
     <artifactId>learnlib-discrimination-tree-vpda</artifactId>
     <name>LearnLib :: Algorithms :: Discrimination Tree [VPDA]</name>
+    <description>
+        A learning algorithm, which distinguishes hypothesis states using a discrimination tree (visibly push-down
+        automata variant).
+    </description>
 
     <dependencies>
         <dependency>

algorithms/active/discrimination-tree/pom.xml

@@ -30,6 +30,7 @@ limitations under the License.
 
     <artifactId>learnlib-discrimination-tree</artifactId>
     <name>LearnLib :: Algorithms :: Discrimination Tree</name>
+    <description>A learning algorithm, which distinguishes hypothesis states using a discrimination tree.</description>
 
     <dependencies>
         <dependency>

algorithms/active/nlstar/pom.xml

@@ -26,6 +26,7 @@ limitations under the License.
     </parent>
     <name>LearnLib :: Algorithms :: NL*</name>
     <artifactId>learnlib-nlstar</artifactId>
+    <description>A variant of the L* algorithm for inferring non-deterministic hypothesis automata.</description>
 
     <dependencies>
         <dependency>

algorithms/active/ttt-vpda/pom.xml

@@ -30,7 +30,7 @@ limitations under the License.
 
     <artifactId>learnlib-ttt-vpda</artifactId>
     <name>LearnLib :: Algorithms :: TTT [VPDA]</name>
-    <description>The TTT Algorithm</description>
+    <description>The TTT Algorithm (visibly push-down automata variant)</description>
 
     <dependencies>
         <!--

commons/util/pom.xml

@@ -29,8 +29,8 @@ limitations under the License.
     </parent>
 
     <artifactId>learnlib-util</artifactId>
-    <name>LearnLib :: Commons :: Commons</name>
-    <description>A collection of standard algorithms for handling counterexamples in automata learning</description>
+    <name>LearnLib :: Commons :: Util</name>
+    <description>A collection of utility methods for learning setups (oracle wrappers, etc.)</description>
 
     <dependencies>
         <!--

drivers/mapper/pom.xml

@@ -29,6 +29,7 @@ limitations under the License.
     <artifactId>learnlib-mapper</artifactId>
 
     <name>LearnLib :: Drivers :: Mapper</name>
+    <description>Translation utilities for mapping abstract hypothesis symbols to concrete SUL symbols</description>
 
     <dependencies>
         <dependency>

drivers/simulator/pom.xml

@@ -30,7 +30,7 @@ limitations under the License.
 
     <artifactId>learnlib-drivers-simulator</artifactId>
     <name>LearnLib :: Drivers :: Simulator</name>
-    <description>Utilities Driver Generation Support</description>
+    <description>Utilities for simulating SULs</description>
 
     <dependencies>
         <!--

oracles/filters/cache/pom.xml

@@ -30,7 +30,7 @@ limitations under the License.
 
     <artifactId>learnlib-cache</artifactId>
     <name>LearnLib :: Filters :: Cache</name>
-    <description>Cache filter to avoid posing duplicate membership queries</description>
+    <description>Caches to avoid posing duplicate membership queries</description>
 
     <dependencies>
         <!--

oracles/filters/reuse/pom.xml

@@ -27,6 +27,7 @@ limitations under the License.
 
     <artifactId>learnlib-reuse</artifactId>
     <name>LearnLib :: Filters :: Reuse</name>
+    <description>Reuse Tree for (intelligently) caching membership queries</description>
 
     <modelVersion>4.0.0</modelVersion>