* HACKING, doc/tl/tl.tex, spot/tl/formula.hh: Typos

This commit is contained in:
Florian Perlié-Long 2017-10-03 08:57:42 +02:00
parent d9d9288132
commit 0f023bd0fe
3 changed files with 5 additions and 5 deletions

View file

@ -609,7 +609,7 @@ SPOT macros
that a compiler might not see as unreachable. that a compiler might not see as unreachable.
* Use SPOT_API in front of functions and class that should be * Use SPOT_API in front of functions and class that should be
exported by the shared library. See "Exporting symbolss" above. exported by the shared library. See "Exporting symbols" above.
* Use SPOT_ASSERT(...) if you ever have to put an assertion in * Use SPOT_ASSERT(...) if you ever have to put an assertion in
some header file. See "Assertions" above. some header file. See "Assertions" above.

View file

@ -206,7 +206,7 @@
Let $\N=\{0,1,2,\ldots\}$ denote the set of natural numbers and Let $\N=\{0,1,2,\ldots\}$ denote the set of natural numbers and
$\omega\not\in\N$ the first transfinite ordinal. We extend the $<$ $\omega\not\in\N$ the first transfinite ordinal. We extend the $<$
relation from $\N$ to $\N\cup\{\omega\}$ with $\forall n\in N,\, relation from $\N$ to $\N\cup\{\omega\}$ with $\forall n\in \N,\,
n<\omega$. Similarly let us extend the addition and subtraction with n<\omega$. Similarly let us extend the addition and subtraction with
$\forall n\in\N,\,\omega+n = \omega-n = \omega+\omega = \omega$. $\forall n\in\N,\,\omega+n = \omega-n = \omega+\omega = \omega$.
@ -1323,8 +1323,8 @@ rewriting arrange any PSL formula into negative normal form.
\NOT(f \M g) & \equiv (\NOT f) \W (\NOT g)& \NOT(f \M g) & \equiv (\NOT f) \W (\NOT g)&
\NOT(\sere{r} \Esuffix f) &\equiv \sere{r} \Asuffix \NOT f \NOT(\sere{r} \Esuffix f) &\equiv \sere{r} \Asuffix \NOT f
\end{align*} \end{align*}
\noindent Recall the that negated weak closure $\nsere{r}$ is actually \noindent Recall that the negated weak closure $\nsere{r}$ is actually
implemented as a specific operator, so it not actually prefixed by the implemented as a specific operator, so it is not actually prefixed by the
$\NOT$ operator. $\NOT$ operator.
\begin{align*} \begin{align*}
f \XOR g & \equiv ((\NOT f)\AND g)\OR(f\AND\NOT g) & f \XOR g & \equiv ((\NOT f)\AND g)\OR(f\AND\NOT g) &

View file

@ -72,7 +72,7 @@ namespace spot
G, ///< Globally G, ///< Globally
Closure, ///< PSL Closure Closure, ///< PSL Closure
NegClosure, ///< Negated PSL Closure NegClosure, ///< Negated PSL Closure
NegClosureMarked, ///< marked version of the Negated PSL Clusure NegClosureMarked, ///< marked version of the Negated PSL Closure
// binary operators // binary operators
Xor, ///< Exclusive Or Xor, ///< Exclusive Or
Implies, ///< Implication Implies, ///< Implication