org: Update results to new output
The dotty output changed to be horizontal, and also the acceptance sets are now numbers. * doc/org/dstar2tgba.org, doc/org/ltl2tgba.org, doc/org/ltl2tgta.org, doc/org/satmin.org: Adjust these four.
This commit is contained in:
Alexandre Duret-Lutz
parent
f88020035c
commit
f9029858c4
4 changed files with 599 additions and 490 deletions
|
|
@ -23,22 +23,22 @@ ltl2tgta --ta --multiple-init 'a U Gb'
|
|||
#+begin_example
|
||||
digraph G {
|
||||
-1 [label="", style=invis, height=0]
|
||||
-1 -> 1 [label="a & b"]
|
||||
-1 -> 1 [label="!a & b"]
|
||||
-2 [label="", style=invis, height=0]
|
||||
-2 -> 2 [label="a & !b"]
|
||||
-2 -> 2 [label="a & b"]
|
||||
-3 [label="", style=invis, height=0]
|
||||
-3 -> 3 [label="b & !a"]
|
||||
1 [label="0\na & b",shape=box]
|
||||
1 -> 3 [label="{a}\n"]
|
||||
1 -> 2 [label="{b}\n"]
|
||||
-3 -> 3 [label="a & !b"]
|
||||
1 [label="2\n!a & b",shape=box]
|
||||
1 -> 4 [label="{a}\n"]
|
||||
2 [label="1\na & !b"]
|
||||
2 -> 1 [label="{b}\n"]
|
||||
2 -> 3 [label="{a, b}\n"]
|
||||
3 [label="2\nb & !a",shape=box]
|
||||
3 -> 4 [label="{a}\n"]
|
||||
2 [label="1\na & b",shape=box]
|
||||
2 -> 4 [label="{a}\n"]
|
||||
2 -> 1 [label="{a}\n"]
|
||||
2 -> 3 [label="{b}\n"]
|
||||
3 [label="0\na & !b"]
|
||||
3 -> 2 [label="{b}\n"]
|
||||
3 -> 1 [label="{a, b}\n"]
|
||||
4 [label="3",peripheries=2,shape=box]
|
||||
4 -> 4 [label="{a}\n{Acc[1]}"]
|
||||
4 -> 4 [label="{a}\n{0}"]
|
||||
}
|
||||
#+end_example
|
||||
|
||||
|
|
@ -50,22 +50,22 @@ ltl2tgta --ta --multiple-init 'a U Gb' | sed 's/\\/\\\\/'
|
|||
#+begin_example
|
||||
digraph G {
|
||||
-1 [label="", style=invis, height=0]
|
||||
-1 -> 1 [label="a & !b"]
|
||||
-1 -> 1 [label="!a & b"]
|
||||
-2 [label="", style=invis, height=0]
|
||||
-2 -> 2 [label="b & !a"]
|
||||
-2 -> 2 [label="a & b"]
|
||||
-3 [label="", style=invis, height=0]
|
||||
-3 -> 3 [label="a & b"]
|
||||
1 [label="2\\na & !b"]
|
||||
1 -> 3 [label="{b}\\n"]
|
||||
1 -> 2 [label="{a, b}\\n"]
|
||||
2 [label="0\\nb & !a",shape=box]
|
||||
-3 -> 3 [label="a & !b"]
|
||||
1 [label="2\\n!a & b",shape=box]
|
||||
1 -> 4 [label="{a}\\n"]
|
||||
2 [label="1\\na & b",shape=box]
|
||||
2 -> 4 [label="{a}\\n"]
|
||||
3 [label="1\\na & b",shape=box]
|
||||
3 -> 2 [label="{a}\\n"]
|
||||
3 -> 1 [label="{b}\\n"]
|
||||
3 -> 4 [label="{a}\\n"]
|
||||
2 -> 1 [label="{a}\\n"]
|
||||
2 -> 3 [label="{b}\\n"]
|
||||
3 [label="0\\na & !b"]
|
||||
3 -> 2 [label="{b}\\n"]
|
||||
3 -> 1 [label="{a, b}\\n"]
|
||||
4 [label="3",peripheries=2,shape=box]
|
||||
4 -> 4 [label="{a}\\n{Acc[1]}"]
|
||||
4 -> 4 [label="{a}\\n{0}"]
|
||||
}
|
||||
#+end_example
|
||||
|
||||
|
|
@ -104,7 +104,7 @@ digraph G {
|
|||
0 [label="", style=invis, height=0]
|
||||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="b & !a\n"]
|
||||
1 -> 2 [label="!a & b\n"]
|
||||
1 -> 3 [label="a & b\n"]
|
||||
1 -> 4 [label="a & !b\n"]
|
||||
2 [label="2",shape=box]
|
||||
|
|
@ -117,7 +117,7 @@ digraph G {
|
|||
4 -> 3 [label="{b}\n"]
|
||||
4 -> 2 [label="{a, b}\n"]
|
||||
5 [label="4",peripheries=2,shape=box]
|
||||
5 -> 5 [label="{a}\n{Acc[1]}"]
|
||||
5 -> 5 [label="{a}\n{0}"]
|
||||
}
|
||||
#+end_example
|
||||
|
||||
|
|
@ -131,20 +131,20 @@ digraph G {
|
|||
0 [label="", style=invis, height=0]
|
||||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="b & !a\\n"]
|
||||
1 -> 2 [label="!a & b\\n"]
|
||||
1 -> 3 [label="a & b\\n"]
|
||||
1 -> 4 [label="a & !b\\n"]
|
||||
2 [label="2",shape=box]
|
||||
2 -> 5 [label="{a}\\n"]
|
||||
3 [label="3",shape=box]
|
||||
3 -> 5 [label="{a}\\n"]
|
||||
3 -> 2 [label="{a}\\n"]
|
||||
3 -> 4 [label="{b}\\n"]
|
||||
3 -> 5 [label="{a}\\n"]
|
||||
4 [label="1"]
|
||||
4 -> 3 [label="{b}\\n"]
|
||||
4 -> 2 [label="{a, b}\\n"]
|
||||
5 [label="4",peripheries=2,shape=box]
|
||||
5 -> 5 [label="{a}\\n{Acc[1]}"]
|
||||
5 -> 5 [label="{a}\\n{0}"]
|
||||
}
|
||||
#+end_example
|
||||
|
||||
|
|
@ -157,7 +157,7 @@ $txt
|
|||
The =--gba= option can be used to request a Generalized Testing
|
||||
Automaton, i.e., a Testing Automaton with Generalized Büchi
|
||||
acceptance. In that case double-enclosures are not used anymore, and
|
||||
Büchi accepting transitions are marked with the same ={Acc[x],Acc[y]}=
|
||||
Büchi accepting transitions are marked with the same ={0,1}=
|
||||
notation used in TGBA.
|
||||
|
||||
#+BEGIN_SRC sh :results verbatim :exports code
|
||||
|
|
@ -170,22 +170,22 @@ digraph G {
|
|||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="a & b\n"]
|
||||
1 -> 3 [label="b & !a\n"]
|
||||
1 -> 3 [label="!a & b\n"]
|
||||
1 -> 4 [label="a & !b\n"]
|
||||
1 -> 5 [label="!b & !a\n"]
|
||||
1 -> 5 [label="!a & !b\n"]
|
||||
2 [label="1",shape=box]
|
||||
2 -> 3 [label="{a}\n{Acc[b], Acc[a]}"]
|
||||
2 -> 4 [label="{b}\n{Acc[b], Acc[a]}"]
|
||||
2 -> 5 [label="{a, b}\n{Acc[b], Acc[a]}"]
|
||||
3 [label="4"]
|
||||
3 -> 2 [label="{a}\n{Acc[b]}"]
|
||||
3 -> 4 [label="{a, b}\n{Acc[b]}"]
|
||||
3 -> 5 [label="{b}\n{Acc[b]}"]
|
||||
2 -> 3 [label="{a}\n{0,1}"]
|
||||
2 -> 4 [label="{b}\n{0,1}"]
|
||||
2 -> 5 [label="{a, b}\n{0,1}"]
|
||||
3 [label="3"]
|
||||
3 -> 2 [label="{a}\n{1}"]
|
||||
3 -> 4 [label="{a, b}\n{1}"]
|
||||
3 -> 5 [label="{b}\n{1}"]
|
||||
4 [label="2"]
|
||||
4 -> 2 [label="{b}\n{Acc[a]}"]
|
||||
4 -> 3 [label="{a, b}\n{Acc[a]}"]
|
||||
4 -> 5 [label="{a}\n{Acc[a]}"]
|
||||
5 [label="3"]
|
||||
4 -> 2 [label="{b}\n{0}"]
|
||||
4 -> 3 [label="{a, b}\n{0}"]
|
||||
4 -> 5 [label="{a}\n{0}"]
|
||||
5 [label="4"]
|
||||
5 -> 2 [label="{a, b}\n"]
|
||||
5 -> 3 [label="{b}\n"]
|
||||
5 -> 4 [label="{a}\n"]
|
||||
|
|
@ -203,22 +203,22 @@ digraph G {
|
|||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="a & b\\n"]
|
||||
1 -> 3 [label="b & !a\\n"]
|
||||
1 -> 3 [label="!a & b\\n"]
|
||||
1 -> 4 [label="a & !b\\n"]
|
||||
1 -> 5 [label="!b & !a\\n"]
|
||||
1 -> 5 [label="!a & !b\\n"]
|
||||
2 [label="1",shape=box]
|
||||
2 -> 3 [label="{a}\\n{Acc[b], Acc[a]}"]
|
||||
2 -> 4 [label="{b}\\n{Acc[b], Acc[a]}"]
|
||||
2 -> 5 [label="{a, b}\\n{Acc[b], Acc[a]}"]
|
||||
3 [label="4"]
|
||||
3 -> 2 [label="{a}\\n{Acc[b]}"]
|
||||
3 -> 4 [label="{a, b}\\n{Acc[b]}"]
|
||||
3 -> 5 [label="{b}\\n{Acc[b]}"]
|
||||
2 -> 3 [label="{a}\\n{0,1}"]
|
||||
2 -> 4 [label="{b}\\n{0,1}"]
|
||||
2 -> 5 [label="{a, b}\\n{0,1}"]
|
||||
3 [label="3"]
|
||||
3 -> 2 [label="{a}\\n{1}"]
|
||||
3 -> 4 [label="{a, b}\\n{1}"]
|
||||
3 -> 5 [label="{b}\\n{1}"]
|
||||
4 [label="2"]
|
||||
4 -> 2 [label="{b}\\n{Acc[a]}"]
|
||||
4 -> 3 [label="{a, b}\\n{Acc[a]}"]
|
||||
4 -> 5 [label="{a}\\n{Acc[a]}"]
|
||||
5 [label="3"]
|
||||
4 -> 2 [label="{b}\\n{0}"]
|
||||
4 -> 3 [label="{a, b}\\n{0}"]
|
||||
4 -> 5 [label="{a}\\n{0}"]
|
||||
5 [label="4"]
|
||||
5 -> 2 [label="{a, b}\\n"]
|
||||
5 -> 3 [label="{b}\\n"]
|
||||
5 -> 4 [label="{a}\\n"]
|
||||
|
|
@ -233,7 +233,7 @@ $txt
|
|||
|
||||
The interpretation is similar to that of the TA. Execution that
|
||||
stutter in a livelock-accepting (square) state are accepting as well
|
||||
as execution that visit the =Acc[a]= and =Acc[b]= acceptance sets
|
||||
as execution that visit the =0= and =1= acceptance sets
|
||||
infinitely often. Those acceptance sets are carried by transitions,
|
||||
as in TGBAs.
|
||||
|
||||
|
|
@ -252,23 +252,23 @@ digraph G {
|
|||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="a & b\n"]
|
||||
1 -> 3 [label="b & !a\n"]
|
||||
1 -> 3 [label="!a & b\n"]
|
||||
1 -> 4 [label="a & !b\n"]
|
||||
1 -> 5 [label="!b & !a\n"]
|
||||
1 -> 5 [label="!a & !b\n"]
|
||||
2 [label="3"]
|
||||
2 -> 3 [label="{a}\n{Acc[b], Acc[a]}"]
|
||||
2 -> 4 [label="{b}\n{Acc[b], Acc[a]}"]
|
||||
2 -> 5 [label="{a, b}\n{Acc[b], Acc[a]}"]
|
||||
2 -> 2 [label="{}\n{Acc[b], Acc[a]}"]
|
||||
3 [label="4"]
|
||||
3 -> 2 [label="{a}\n{Acc[b]}"]
|
||||
3 -> 4 [label="{a, b}\n{Acc[b]}"]
|
||||
3 -> 5 [label="{b}\n{Acc[b]}"]
|
||||
2 -> 3 [label="{a}\n{0,1}"]
|
||||
2 -> 4 [label="{b}\n{0,1}"]
|
||||
2 -> 5 [label="{a, b}\n{0,1}"]
|
||||
2 -> 2 [label="{}\n{0,1}"]
|
||||
3 [label="2"]
|
||||
3 -> 2 [label="{a}\n{1}"]
|
||||
3 -> 4 [label="{a, b}\n{1}"]
|
||||
3 -> 5 [label="{b}\n{1}"]
|
||||
3 -> 3 [label="{}\n"]
|
||||
4 [label="2"]
|
||||
4 -> 2 [label="{b}\n{Acc[a]}"]
|
||||
4 -> 3 [label="{a, b}\n{Acc[a]}"]
|
||||
4 -> 5 [label="{a}\n{Acc[a]}"]
|
||||
4 [label="4"]
|
||||
4 -> 2 [label="{b}\n{0}"]
|
||||
4 -> 3 [label="{a, b}\n{0}"]
|
||||
4 -> 5 [label="{a}\n{0}"]
|
||||
4 -> 4 [label="{}\n"]
|
||||
5 [label="1"]
|
||||
5 -> 2 [label="{a, b}\n"]
|
||||
|
|
@ -289,25 +289,25 @@ digraph G {
|
|||
0 -> 1
|
||||
1 [label=init]
|
||||
1 -> 2 [label="a & b\\n"]
|
||||
1 -> 3 [label="b & !a\\n"]
|
||||
1 -> 3 [label="!a & b\\n"]
|
||||
1 -> 4 [label="a & !b\\n"]
|
||||
1 -> 5 [label="!b & !a\\n"]
|
||||
2 [label="1"]
|
||||
2 -> 3 [label="{a}\\n{Acc[b], Acc[a]}"]
|
||||
2 -> 4 [label="{b}\\n{Acc[b], Acc[a]}"]
|
||||
2 -> 5 [label="{a, b}\\n{Acc[b], Acc[a]}"]
|
||||
2 -> 2 [label="{}\\n{Acc[b], Acc[a]}"]
|
||||
3 [label="4"]
|
||||
3 -> 2 [label="{a}\\n{Acc[b]}"]
|
||||
3 -> 4 [label="{a, b}\\n{Acc[b]}"]
|
||||
3 -> 5 [label="{b}\\n{Acc[b]}"]
|
||||
1 -> 5 [label="!a & !b\\n"]
|
||||
2 [label="3"]
|
||||
2 -> 3 [label="{a}\\n{0,1}"]
|
||||
2 -> 4 [label="{b}\\n{0,1}"]
|
||||
2 -> 5 [label="{a, b}\\n{0,1}"]
|
||||
2 -> 2 [label="{}\\n{0,1}"]
|
||||
3 [label="2"]
|
||||
3 -> 2 [label="{a}\\n{1}"]
|
||||
3 -> 4 [label="{a, b}\\n{1}"]
|
||||
3 -> 5 [label="{b}\\n{1}"]
|
||||
3 -> 3 [label="{}\\n"]
|
||||
4 [label="3"]
|
||||
4 -> 2 [label="{b}\\n{Acc[a]}"]
|
||||
4 -> 3 [label="{a, b}\\n{Acc[a]}"]
|
||||
4 -> 5 [label="{a}\\n{Acc[a]}"]
|
||||
4 [label="4"]
|
||||
4 -> 2 [label="{b}\\n{0}"]
|
||||
4 -> 3 [label="{a, b}\\n{0}"]
|
||||
4 -> 5 [label="{a}\\n{0}"]
|
||||
4 -> 4 [label="{}\\n"]
|
||||
5 [label="2"]
|
||||
5 [label="1"]
|
||||
5 -> 2 [label="{a, b}\\n"]
|
||||
5 -> 3 [label="{b}\\n"]
|
||||
5 -> 4 [label="{a}\\n"]
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue