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

dot: display acceptance names

Browse source 
* spot/twaalgos/dot.cc: Display common acceptance names.
* NEWS: Mention the change.
* doc/org/oaut.org: Adjust text.
* tests/core/alternating.test, tests/core/readsave.test,
tests/python/_altscc.ipynb, tests/python/alternation.ipynb,
tests/python/atva16-fig2a.ipynb, tests/python/atva16-fig2b.ipynb,
tests/python/automata.ipynb, tests/python/decompose.ipynb,
tests/python/gen.ipynb, tests/python/highlighting.ipynb,
tests/python/product.ipynb, tests/python/randaut.ipynb: Adjust test
cases.
This commit is contained in:
Alexandre Duret-Lutz 2017-08-15 22:48:57 +02:00
parent f8ef06acc6
commit 1cc45b2413
15 changed files with 1455 additions and 1872 deletions
Download patch file Download diff file Expand all files Collapse all files

74
doc/org/oaut.org
View file

@ -610,21 +610,21 @@ ltl2tgba --dot=vcsna '(Ga -> Gb) W c'
#+RESULTS:
#+begin_example
digraph G {
label="(Gb | F!a) W c\nInf(0)"
label="(Gb | F!a) W c\nInf(0)\n[Büchi]"
labelloc="t"
node [shape="circle"]
node[style=filled, fillcolor="#ffffa0"]
edge[arrowhead=vee, arrowsize=.7]
I [label="", style=invis, height=0]
I -> 1
I -> 0
subgraph cluster_0 {
color=green
label=""
0 [label="0"]
1 [label="1"]
}
subgraph cluster_1 {
color=green
label=""
3 [label="3"]
2 [label="2"]
}
subgraph cluster_2 {
color=red
@ -634,20 +634,20 @@ digraph G {
subgraph cluster_3 {
color=green
label=""
1 [label="1"]
2 [label="2"]
0 [label="0"]
3 [label="3"]
}
0 -> 0 [label="b\n{0}"]
1 -> 0 [label="a & b & !c"]
1 -> 1 [label="!a & !c\n{0}"]
1 -> 2 [label="a & !c"]
1 -> 3 [label="c"]
2 -> 1 [label="!a & !c\n{0}"]
2 -> 2 [label="a & !c"]
2 -> 3 [label="!a & c"]
2 -> 4 [label="a & c"]
3 -> 3 [label="1\n{0}"]
4 -> 3 [label="!a"]
0 -> 0 [label="!a & !c\n{0}"]
0 -> 1 [label="c"]
0 -> 2 [label="a & b & !c"]
0 -> 3 [label="a & !c"]
1 -> 1 [label="1\n{0}"]
2 -> 2 [label="b\n{0}"]
3 -> 0 [label="!a & !c\n{0}"]
3 -> 1 [label="!a & c"]
3 -> 3 [label="a & !c"]
3 -> 4 [label="a & c"]
4 -> 1 [label="!a"]
4 -> 4 [label="a"]
}
#+end_example
@ -660,20 +660,20 @@ SPOT_DOTEXTRA= ltl2tgba --dot=vcsna '(Ga -> Gb) W c'
#+RESULTS: oaut-dot2
#+begin_example
digraph G {
label="(Gb | F!a) W c\nInf(0)"
label="(Gb | F!a) W c\nInf(0)\n[Büchi]"
labelloc="t"
node [shape="circle"]
I [label="", style=invis, height=0]
I -> 1
I -> 0
subgraph cluster_0 {
color=green
label=""
0 [label="0"]
1 [label="1"]
}
subgraph cluster_1 {
color=green
label=""
3 [label="3"]
2 [label="2"]
}
subgraph cluster_2 {
color=red
@ -683,20 +683,20 @@ digraph G {
subgraph cluster_3 {
color=green
label=""
1 [label="1"]
2 [label="2"]
0 [label="0"]
3 [label="3"]
}
0 -> 0 [label="b\n{0}"]
1 -> 0 [label="a & b & !c"]
1 -> 1 [label="!a & !c\n{0}"]
1 -> 2 [label="a & !c"]
1 -> 3 [label="c"]
2 -> 1 [label="!a & !c\n{0}"]
2 -> 2 [label="a & !c"]
2 -> 3 [label="!a & c"]
2 -> 4 [label="a & c"]
3 -> 3 [label="1\n{0}"]
4 -> 3 [label="!a"]
0 -> 0 [label="!a & !c\n{0}"]
0 -> 1 [label="c"]
0 -> 2 [label="a & b & !c"]
0 -> 3 [label="a & !c"]
1 -> 1 [label="1\n{0}"]
2 -> 2 [label="b\n{0}"]
3 -> 0 [label="!a & !c\n{0}"]
3 -> 1 [label="!a & c"]
3 -> 3 [label="a & !c"]
3 -> 4 [label="a & c"]
4 -> 1 [label="!a"]
4 -> 4 [label="a"]
}
#+end_example
@ -710,7 +710,9 @@ $txt
The acceptance condition is displayed in the same way as in the [[http://adl.github.io/hoaf/][HOA
format]]. Here =Inf(0)= means that runs are accepting if and only if
they visit some the transitions in the set #0 infinitely often.
they visit some the transitions in the set #0 infinitely often. For
well known acceptance conditions (as Büchi in this case), their name
is also displayed in bracket below.
The strongly connected components are displayed using the following colors:
- *green* components contain an accepting cycle