cleanups

mtf90 · mtf90 · commit c30e177ed2ef · 2025-02-04T12:02:04.000+01:00
diff --git a/_includes/footer.html b/_includes/footer.html
@@ -17,7 +17,7 @@
             </ul>
             <ul class="nav d-block d-md-flex">
                 <li class="nav-item">
-                    <a class="nav-link tu-link" href="https://ps.cs.tu-dortmund.de">
+                    <a class="nav-link tu-link" href="https://tu-dortmund.de">
                         <img style="height: 24px; margin-right: 8px; margin-top: -4px;" src="{{ '/assets/images/tu.png' | relative_url }}" alt="TU Dortmund logo">TU Dortmund University</a>
                 </li>
             </ul>
diff --git a/index.md b/index.md
@@ -8,7 +8,7 @@ navbar-group: "Projects"
 ## Learnlib
 
 LearnLib is a free and open source ([Apache License 2.0](https://www.apache.org/licenses/LICENSE-2.0)) Java framework for automata learning.
-It is mainly being developed at the [Chair of Programming Systems](http://ls5-www.cs.tu-dortmund.de/) at [TU Dortmund University, Germany](http://www.tu-dortmund.de/).
+It is mainly being developed at [TU Dortmund University, Germany](https://cs.tu-dortmund.de/).
 20 years of research in the field of automated learning as well as our experience in engineering software have gone into the development of LearnLib.
 
 ## Usage
@@ -64,13 +64,14 @@ LearnLib provides a sophisticated set of active and passive learning algorithms
 - Complete, depth-bounded exploration
 - Random words
 - Random walk
-- W-method (incl. variants)
-- Wp-method (incl. variants)
+- (partial) W-method (incl. variants)
+- Black-Box Checking (via [LTSmin](https://ltsmin.utwente.nl/))
 
 #### More features
 
 - Query cache
 - Parallel oracles
+- Statistics
 - Reuse filter
-- Abstract to concrete system mapping
+- Abstract to concrete symbol mapping
 - Generic, extensible design
diff --git a/pages/automatalib.md b/pages/automatalib.md
@@ -17,7 +17,7 @@ Furthermore, a plethora of graph-/automata-based algorithms is implemented, cove
 
 - graph theory (traversal, shortest paths, strongly-connected components)
 - automata theory (equivalence, minimization)
-- model checking (adaptive distinguishing sequences, W(p)Method, characterizing sets, state/transition covers, LTL checking (via [LTSMin](https://ltsmin.utwente.nl/) and M3C)
+- model checking (adaptive distinguishing sequences, (partial) W-method, characterizing sets, state/transition covers, LTL checking (via [LTSmin](https://ltsmin.utwente.nl/) and M3C)
 
 ## Usage
 
