--- a/main/queueing/doc/markovchains.txi	Wed Feb 15 10:20:36 2012 +0000
+++ b/main/queueing/doc/markovchains.txi	Wed Feb 15 11:54:15 2012 +0000
@@ -43,11 +43,7 @@
 @end tex
 @end iftex
 @ifnottex
-@example
-@group
-P(X_@{n+1@} = x_@{n+1@} | X_n = x_n, X_@{n-1@} = x_@{n-1@}, ..., X_0 = x_0) = P(X_@{n+1@} = x_@{n+1@} | X_n = x_n)
-@end group
-@end example
+@math{P(X_{n+1} = x_{n+1} | X_n = x_n, X_{n-1} = x_{n-1}, ..., X_0 = x_0) = P(X_{n+1} = x_{n+1} | X_n = x_n)}
 @end ifnottex
 
 @noindent which means that the probability that the system is in 
@@ -92,7 +88,8 @@
 Under certain conditions, there exists a @emph{stationary state
 occupancy probability} @math{{\bf \pi} = \lim_{n \rightarrow +\infty}
 {\bf \pi}(n)}, which is independent from the initial state occupancy
-@math{{\bf \pi}(0)}. 
+@math{{\bf \pi}(0)}. The stationary state occupancy probability vector
+@math{\bf \pi} satisfies @math{{\bf \pi} = {\bf \pi} {\bf P}}.
 
 @DOCSTRING(dtmc)
 
@@ -104,7 +101,6 @@
 @end group
 @end example
 
-
 The First Passage Time @math{M_{i j}} is defined as the average
 number of transitions needed to visit state @math{j} for the first
 time, starting from state @math{i}. Matrix @math{\bf M} satisfies the

--- a/main/queueing/doc/queueing.html	Wed Feb 15 10:20:36 2012 +0000
+++ b/main/queueing/doc/queueing.html	Wed Feb 15 11:54:15 2012 +0000
@@ -791,9 +791,9 @@
 <small class="dots">...</small>. A <em>Markov chain</em> is a stochastic process {X_n,
 n=0, 1, 2, <small class="dots">...</small>} which satisfies the following Marrkov property:
 
-<pre class="example">     P(X_{n+1} = x_{n+1} | X_n = x_n, X_{n-1} = x_{n-1}, ..., X_0 = x_0) = P(X_{n+1} = x_{n+1} | X_n = x_n)
-</pre>
-   <p class="noindent">which means that the probability that the system is in
+   <p>P(X_n+1 = x_n+1 | X_n = x_n, X_n-1 = x_n-1, ..., X_0 = x_0) = P(X_n+1 = x_n+1 | X_n = x_n)
+
+<p class="noindent">which means that the probability that the system is in
 a particular state at time n+1 only depends on the state the
 system was at time n.
 
@@ -824,7 +824,8 @@
    <p>Under certain conditions, there exists a <em>stationary state
 occupancy probability</em> \bf \pi = \lim_n \rightarrow +\infty
 \bf \pi(n), which is independent from the initial state occupancy
-\bf \pi(0).
+\bf \pi(0). The stationary state occupancy probability vector
+\bf \pi satisfies \bf \pi = \bf \pi \bf P.
 
    <p><a name="doc_002ddtmc"></a>
 
@@ -3445,7 +3446,7 @@
           <br><dt><var>V</var><dd><var>V</var><code>(c,k)</code> is the average number of visits of class c
 customers to service center k; <var>V</var><code>(c,k) &ge; 0</code>,
 default is 1. 
-<strong>If you pass this parameter, no class switching is not
+<strong>If you pass this parameter, class switching is not
 allowed</strong>
 
           <br><dt><var>P</var><dd><var>P</var><code>(r,i,s,j)</code> is the probability that a class r

Binary file main/queueing/doc/queueing.pdf has changed

--- a/main/queueing/inst/qnclosedmultimva.m	Wed Feb 15 10:20:36 2012 +0000
+++ b/main/queueing/inst/qnclosedmultimva.m	Wed Feb 15 11:54:15 2012 +0000
@@ -91,7 +91,7 @@
 ## @code{@var{V}(c,k)} is the average number of visits of class @math{c}
 ## customers to service center @math{k}; @code{@var{V}(c,k) @geq{} 0},
 ## default is 1.
-## @strong{If you pass this parameter, no class switching is not
+## @strong{If you pass this parameter, class switching is not
 ## allowed}
 ##
 ## @item P