alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Simplify {b && {r1:...:rn}} as {b && r1 && ... && rn}.

Browse source 
* src/ltlvisit/simplify.cc (simplify_visitor): Do it.
* src/ltltest/reduccmp.test: Add a test.
* doc/tl/tl.tex: Document it.
* src/ltlast/multop.cc: Fix the computation of is.accepting_eword
for Fusion.  The Fusion operator never accepts [*0].
This commit is contained in:
Alexandre Duret-Lutz 2011-12-01 17:48:15 +01:00
parent 77084747b9
commit d0cfd44ba6
4 changed files with 28 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

5
doc/tl/tl.tex
View file

@ -1267,7 +1267,9 @@ in the OR arguments:
\subsubsection{Basic Simplifications for SERE Operators}
% Cite Symbolic computation of PSL.
\spottodo[inline]{These rules, mostly taken from ``Symbolic
computation of PSL'' (Cimatti, Roveri, and Tonetta) are not complete
yet.}
The following simplification rules are used for the $n$-ary operators
$\ANDALT$, $\AND$, and $\OR$, and are of course commutative.
@ -1288,6 +1290,7 @@ $\ANDALT$, $\AND$, and $\OR$, and are of course commutative.
b \ANDALT r &\text{if~} i\le 1\le j\\
\0 &\text{else}\\
\end{cases}\\
b \ANDALT \ratgroup{r_1 \FUSION \ldots \FUSION r_n}& \equiv b \ANDALT r_1 \ANDALT \ldots \ANDALT r_n \\
\end{align*}
\subsection{Simplifications for Eventual and Universal Formul\ae}