Fix trivial rules for b₁:b₂ and b&f.
* src/ltlast/multop.cc (instance): Here. * src/ltlast/multop.hh, doc/tl/tl.tex: Adjust documentation. * src/ltltest/equals.test: Adjust test cases.
This commit is contained in:
parent
a4353d3985
commit
866384b423
4 changed files with 38 additions and 33 deletions
|
|
@ -692,7 +692,7 @@ $b_1$, $b_2$ are assumed to be Boolean formul\ae.
|
|||
\end{align*}
|
||||
|
||||
\noindent
|
||||
The following rules are all valid with the two arguments swapped, except the one marked with $\equivM$.
|
||||
The following rules are all valid with the two arguments swapped.
|
||||
%(Even for the non-commutative operators \samp{$\CONCAT$} and
|
||||
%\samp{$\FUSION$}.)
|
||||
|
||||
|
|
@ -721,7 +721,7 @@ The following rules are all valid with the two arguments swapped, except the one
|
|||
b_1 \AND b_2 &\equiv b_1\ANDALT b_2 &
|
||||
&&
|
||||
&&
|
||||
b:f &\equivM b\AND f\\
|
||||
b_1:b_2 &\equiv b_1\ANDALT b_2\\
|
||||
\end{align*}
|
||||
|
||||
\section{SERE-LTL Binding Operators}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue