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

ltl2tgba.html: document [:*i..j]

Browse source 
For issue #51.

* wrap/python/ajax/ltl2tgba.html: Here.
This commit is contained in:
Alexandre Duret-Lutz 2015-01-19 14:38:09 +01:00
parent 34f1601b9b
commit 1d724beabd
1 changed files with 13 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

20
wrap/python/ajax/ltl2tgba.html
View file

@ -343,7 +343,7 @@ an identifier: <span class="formula">aUb</span> is an atomic proposition, unlike
<tr> <tr>
<th></th> <th></th>
<th colspan=2>Constants</th> <th colspan=2>Constants</th>
<th colspan=2>Unary operators (prefix)</th> <th colspan=2>Unary operators</th>
<th colspan=4>Binary operators (infix)</th> <th colspan=4>Binary operators (infix)</th>
</tr> </tr>
</thead> </thead>
@ -400,10 +400,10 @@ an identifier: <span class="formula">aUb</span> is an atomic proposition, unlike
</tbody> </tbody>
<tbody> <tbody>
<tr> <tr>
<td class="ltldocrow" rowspan=3><ABBR title="Sequential Extended Regular <td class="ltldocrow" rowspan=4><ABBR title="Sequential Extended Regular
Expression">SERE</ABBR></td> Expression">SERE</ABBR></td>
<td class="ltldoc">ε:</td><td><span class="formula">[*0]</span></td> <td class="ltldoc">ε:</td><td><span class="formula">[*0]</span></td>
<td class="ltldoc">Kleene star:</td><td><span class="formula">[*]</span> <span class="formula">[*</span><i>i..j</i><span class="formula">]</span></td> <td class="ltldoc">Kleene star:</td><td><span class="formula">[*] </span><span class="formula">[+]</span> <span class="formula">[*</span><i>i..j</i><span class="formula">]</span></td>
<td class="ltldoc">concatenation:</td><td><span class="formula">;</span></td> <td class="ltldoc">concatenation:</td><td><span class="formula">;</span></td>
<td class="ltldoc">fusion:</td><td><span class="formula">:</span></td> <td class="ltldoc">fusion:</td><td><span class="formula">:</span></td>
</tr> </tr>
@ -419,20 +419,26 @@ an identifier: <span class="formula">aUb</span> is an atomic proposition, unlike
<td class="ltldoc">union:</td><td><span class="formula">|</span> <span class="formula">||</span> <span class="formula">+</span> <span class="formula">\/</span></td> <td class="ltldoc">union:</td><td><span class="formula">|</span> <span class="formula">||</span> <span class="formula">+</span> <span class="formula">\/</span></td>
<td></td><td></td> <td></td><td></td>
</tr> </tr>
<tr>
<td></td><td></td>
<td class="ltldoc"><abbr title="The operator <span class='formula'>[:+]</span> corresponds to the <span class='formula'>⊕</span> operator introduced by Dax et al. (<i>Specification Languages for Stutter-Invariant Regular Properties</i>, ATVA'09). The other two are generalizations to different bounds.">iterated fusion</abbr>:</td><td><span class="formula">[:*] </span><span class="formula">[:+]</span> <span class="formula">[:*</span><i>i..j</i><span class="formula">]</span></td>
<td></td><td></td>
<td></td><td></td>
</tr>
</tbody> </tbody>
<tbody> <tbody>
<tr> <tr>
<td class="ltldocrow" rowspan=2><ABBR title="Property Specification Language">PSL</ABBR></td> <td class="ltldocrow" rowspan=2><ABBR title="Property Specification Language">PSL</ABBR></td>
<td></td><td></td> <td></td><td></td>
<td class="ltldoc">weak closure:</td><td><span class="formula">{</span><i>s</i><span class="formula">}</span></td> <td class="ltldoc">weak closure:</td><td><span class="formula">{</span><i>s</i><span class="formula">}</span></td>
<td class="ltldoc">∀-suffix impl.:</td><td><span class="formula">{</span><i>s</i><span class="formula">}[]-></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}|-></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}(</span><i>p</i><span class="formula">)</span></td> <td class="ltldoc">triggers:</td><td><span class="formula">{</span><i>s</i><span class="formula">}[]-></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}|-></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}(</span><i>p</i><span class="formula">)</span></td>
<td class="ltldoc"><ABBR title="Non-Overlapping">NO</ABBR> ∀-suffix impl.:</td><td><span class="formula">{</span><i>s</i><span class="formula">}[]=></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}|=></span><i>p</i></td> <td class="ltldoc"><ABBR title="Non-Overlapping">Non-Ov.</ABBR> trigger:</td><td><span class="formula">{</span><i>s</i><span class="formula">}[]=></span><i>p</i><br><span class="formula">{</span><i>s</i><span class="formula">}|=></span><i>p</i></td>
</tr> </tr>
<tr> <tr>
<td></td><td></td> <td></td><td></td>
<td class="ltldoc">strong closure:</td><td><span class="formula">{</span><i>s</i><span class="formula">}!</span></td> <td class="ltldoc">strong closure:</td><td><span class="formula">{</span><i>s</i><span class="formula">}!</span></td>
<td class="ltldoc">∃-suffix impl.:</td><td><span class="formula">{</span><i>s</i><span class="formula">}&lt;&gt;-></span><i>p</i></td> <td class="ltldoc">seq:</td><td><span class="formula">{</span><i>s</i><span class="formula">}&lt;&gt;-></span><i>p</i></td>
<td class="ltldoc"><ABBR title="Non-Overlapping">NO</ABBR> ∃-suffix impl.:</td><td><span class="formula">{</span><i>s</i><span class="formula">}&lt;&gt;=></span><i>p</i></td> <td class="ltldoc"><ABBR title="Non-Overlapping">Non-Ov.</ABBR> seq:</td><td><span class="formula">{</span><i>s</i><span class="formula">}&lt;&gt;=></span><i>p</i></td>
</tr> </tr>
</tbody> </tbody>
</table> </table>