org: show some useful R operations on ltlcross output
* doc/org/ltlcross.org: Here. * doc/org/init.el.in, doc/org/.dir-locals.el.in: Enable R, and install ess.
This commit is contained in:
Alexandre Duret-Lutz
parent
640e54a5d9
commit
ff19c0620f
3 changed files with 276 additions and 135 deletions
|
|
@ -31,12 +31,14 @@
|
||||||
(python . t)
|
(python . t)
|
||||||
(plantuml . t)
|
(plantuml . t)
|
||||||
(dot . t)
|
(dot . t)
|
||||||
|
(R . t)
|
||||||
(C . t)))))
|
(C . t)))))
|
||||||
(org-confirm-babel-evaluate . nil)
|
(org-confirm-babel-evaluate . nil)
|
||||||
(org-plantuml-jar-path . "@abs_top_builddir@/doc/org/plantuml.jar")
|
(org-plantuml-jar-path . "@abs_top_builddir@/doc/org/plantuml.jar")
|
||||||
(org-babel-python-command . "@PYTHON@")
|
(org-babel-python-command . "@PYTHON@")
|
||||||
(org-babel-C++-compiler . "./g++wrap")
|
(org-babel-C++-compiler . "./g++wrap")
|
||||||
(shell-file-name . "@SHELL@")
|
(shell-file-name . "@SHELL@")
|
||||||
|
(ess-ask-for-ess-directory . nil)
|
||||||
(org-export-html-postamble . nil)
|
(org-export-html-postamble . nil)
|
||||||
(org-babel-default-header-args:plantuml
|
(org-babel-default-header-args:plantuml
|
||||||
. ((:results . "file")
|
. ((:results . "file")
|
||||||
|
|
|
||||||
|
|
@ -29,11 +29,17 @@
|
||||||
(let ((org-p-c (cadr (assq 'org-plus-contrib package-archive-contents))))
|
(let ((org-p-c (cadr (assq 'org-plus-contrib package-archive-contents))))
|
||||||
(package-install org-p-c)))
|
(package-install org-p-c)))
|
||||||
|
|
||||||
(unless (require 'htmlize nil t)
|
(let ((have-htmlize (require 'htmlize nil t))
|
||||||
(add-to-list 'package-archives '("melpa" . "http://melpa.org/packages/") t)
|
(have-ess (require 'ess nil t)))
|
||||||
(package-refresh-contents)
|
(unless (and have-htmlize have-ess)
|
||||||
(let ((htmlize (cadr (assq 'htmlize package-archive-contents))))
|
(add-to-list 'package-archives '("melpa" . "http://melpa.org/packages/") t)
|
||||||
(package-install htmlize)))
|
(package-refresh-contents)
|
||||||
|
(unless have-htmlize
|
||||||
|
(let ((htmlize (cadr (assq 'htmlize package-archive-contents))))
|
||||||
|
(package-install htmlize)))
|
||||||
|
(unless have-ess
|
||||||
|
(let ((ess (cadr (assq 'ess package-archive-contents))))
|
||||||
|
(package-install ess)))))
|
||||||
|
|
||||||
(require 'ox-publish)
|
(require 'ox-publish)
|
||||||
(require 'org-install)
|
(require 'org-install)
|
||||||
|
|
@ -54,6 +60,7 @@
|
||||||
(dot . t)
|
(dot . t)
|
||||||
(python . t)
|
(python . t)
|
||||||
(plantuml . t)
|
(plantuml . t)
|
||||||
|
(R . t)
|
||||||
(C . t)))
|
(C . t)))
|
||||||
(setq org-confirm-babel-evaluate nil)
|
(setq org-confirm-babel-evaluate nil)
|
||||||
(setq org-plantuml-jar-path "@abs_top_builddir@/doc/org/plantuml.jar")
|
(setq org-plantuml-jar-path "@abs_top_builddir@/doc/org/plantuml.jar")
|
||||||
|
|
@ -65,6 +72,7 @@
|
||||||
(setq org-babel-python-command "@PYTHON@")
|
(setq org-babel-python-command "@PYTHON@")
|
||||||
(setq org-babel-C++-compiler "./g++wrap")
|
(setq org-babel-C++-compiler "./g++wrap")
|
||||||
(setq shell-file-name "@SHELL@")
|
(setq shell-file-name "@SHELL@")
|
||||||
|
(setq ess-ask-for-ess-directory nil)
|
||||||
|
|
||||||
(setq org-babel-default-header-args:plantuml
|
(setq org-babel-default-header-args:plantuml
|
||||||
'((:results . "file")
|
'((:results . "file")
|
||||||
|
|
|
||||||
|
|
@ -13,7 +13,7 @@ The main differences with LBTT are:
|
||||||
- *support for PSL formulas in addition to LTL*
|
- *support for PSL formulas in addition to LTL*
|
||||||
- support for (non-alternating) automata with *any type of acceptance condition*,
|
- support for (non-alternating) automata with *any type of acceptance condition*,
|
||||||
- support for *weak alternating automata*,
|
- support for *weak alternating automata*,
|
||||||
- additional intersection *checks with the complement*, allowing
|
- additional intersection *checks with the complement* (option =-D=), allowing
|
||||||
to check equivalence of automata more precisely,
|
to check equivalence of automata more precisely,
|
||||||
- *more statistics*, especially:
|
- *more statistics*, especially:
|
||||||
- the number of logical transitions represented by each physical edge,
|
- the number of logical transitions represented by each physical edge,
|
||||||
|
|
@ -21,7 +21,7 @@ The main differences with LBTT are:
|
||||||
- the number of SCCs with their various strengths (nonaccepting, terminal, weak, strong)
|
- the number of SCCs with their various strengths (nonaccepting, terminal, weak, strong)
|
||||||
- the number of terminal, weak, and strong automata
|
- the number of terminal, weak, and strong automata
|
||||||
- an option to *reduce counterexample* by attempting to mutate and
|
- an option to *reduce counterexample* by attempting to mutate and
|
||||||
shorten troublesome formulas,
|
shorten troublesome formulas (option =--grind=),
|
||||||
- statistics output in *CSV* for easier post-processing,
|
- statistics output in *CSV* for easier post-processing,
|
||||||
- *more precise time measurement* (LBTT was only precise to
|
- *more precise time measurement* (LBTT was only precise to
|
||||||
1/100 of a second, reporting most times as "0.00s").
|
1/100 of a second, reporting most times as "0.00s").
|
||||||
|
|
@ -229,6 +229,131 @@ of untrusted references. The easiest way to observe the effect of
|
||||||
=--reference= is to run the =ltlcross= with the [[#verbose][=--verbose= option]],
|
=--reference= is to run the =ltlcross= with the [[#verbose][=--verbose= option]],
|
||||||
with and without some =--reference= translators.
|
with and without some =--reference= translators.
|
||||||
|
|
||||||
|
* Detecting problems
|
||||||
|
:PROPERTIES:
|
||||||
|
:CUSTOM_ID: checks
|
||||||
|
:END:
|
||||||
|
|
||||||
|
If a translator exits with a non-zero status code, or fails to output
|
||||||
|
an automaton =ltlcross= can read, and error will be displayed and the
|
||||||
|
result of the translation will be discarded.
|
||||||
|
|
||||||
|
Otherwise =ltlcross= performs the following checks on all translated
|
||||||
|
formulas ($P_i$ and $N_i$ designate respectively the translation of
|
||||||
|
positive and negative formulas by the ith translator).
|
||||||
|
|
||||||
|
- Intersection check: $P_i\otimes N_j$ must be empty for all
|
||||||
|
pairs of $(i,j)$.
|
||||||
|
|
||||||
|
A single failing translator might generate a lot of lines of
|
||||||
|
the form:
|
||||||
|
|
||||||
|
: error: P0*N1 is nonempty; both automata accept the infinite word:
|
||||||
|
: cycle{p0 & !p1}
|
||||||
|
: error: P1*N0 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; cycle{p0 & p1}
|
||||||
|
: error: P1*N1 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; cycle{!p1 & !p0}
|
||||||
|
: error: P1*N2 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; cycle{p0 & p1}
|
||||||
|
: error: P1*N3 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; cycle{p0 & p1}
|
||||||
|
: error: P1*N4 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; cycle{!p1 & !p0}
|
||||||
|
: error: P2*N1 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; !p0; cycle{!p1 & !p0; p0 & !p1; !p1; !p1; p0 & !p1}
|
||||||
|
: error: P3*N1 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; !p1 & !p0; cycle{p0 & !p1}
|
||||||
|
: error: P4*N1 is nonempty; both automata accept the infinite word:
|
||||||
|
: p0; !p1; !p1 & !p0; cycle{p0 & !p1}
|
||||||
|
|
||||||
|
In this example, translator number =1= looks clearly faulty
|
||||||
|
(at least the other 4 translators do not contradict each other).
|
||||||
|
|
||||||
|
Examples of infinite words that are accepted by both automata
|
||||||
|
always have the form of a lasso: a (possibly empty) finite prefix
|
||||||
|
followed by a cycle that should be repeated infinitely often.
|
||||||
|
The cycle part is denoted by =cycle{...}=.
|
||||||
|
|
||||||
|
- Complemented intersection check. If $P_i$ and $N_i$ are
|
||||||
|
deterministic, =ltlcross= builds their complements, $Comp(P_i)$
|
||||||
|
and $Comp(N_i)$, and then ensures that $Comp(P_i)\otimes
|
||||||
|
Comp(N_i)$ is empty. If only one of them is deterministic, for
|
||||||
|
instance $P_i$, we check that $P_j\otimes Comp(P_i)$ for all $j
|
||||||
|
\ne i$; likewise if it's $N_i$ that is deterministic.
|
||||||
|
|
||||||
|
By default this check is only done for deterministic automata,
|
||||||
|
because complementation is relatively cheap is that case (at least
|
||||||
|
it is cheap for simple acceptance conditions). Using option
|
||||||
|
=--determinize=, =ltlcross= can be instructed to perform
|
||||||
|
complementation of non-deterministic automata as well, ensuring
|
||||||
|
precise equivalence checks between all automata. However be aware
|
||||||
|
that this determinization + complementation may generate large
|
||||||
|
automata.
|
||||||
|
|
||||||
|
When validating a translator with =ltlcross= without using the
|
||||||
|
=--determinize= option we highly recommend to include a translator
|
||||||
|
with good deterministic output to augment test coverage. Using
|
||||||
|
'=ltl2tgba -lD %f >%O=' will produce deterministic automata for
|
||||||
|
all obligation properties and many recurrence properties. Using
|
||||||
|
'=ltl2dstar --ltl2nba=spin:pathto/ltl2tgba@-Ds %L %O=' will
|
||||||
|
systematically produce a deterministic Rabin automaton (that
|
||||||
|
=ltlcross= can complement easily).
|
||||||
|
|
||||||
|
- Cross-comparison checks: for some state-space $S$,
|
||||||
|
all $P_i\otimes S$ are either all empty, or all non-empty.
|
||||||
|
Similarly all $N_i\otimes S$ are either all empty, or all non-empty.
|
||||||
|
|
||||||
|
A cross-comparison failure could be displayed as:
|
||||||
|
|
||||||
|
: error: {P0,P2} disagree with {P1} when evaluating the state-space
|
||||||
|
: the following word(s) are not accepted by {P1}:
|
||||||
|
: P0 accepts: p0 & !p1 & !p2 & p3; p0 & p1 & !p2 & p3; p0 & p1 & p2 & p3; cycle{p0 & p1 & p2 & p3; p0 & p1 & !p2 & !p3; p0 & p1 & p2 & !p3; p0 & p1 & !p2 & !p3}
|
||||||
|
: P2 accepts: p0 & !p1 & !p2 & p3; cycle{p0 & p1 & !p2 & !p3; p0 & p1 & p2 & p3; p0 & p1 & !p2 & p3}
|
||||||
|
|
||||||
|
If =--products=N= is used with =N= greater than one, the number of
|
||||||
|
the state-space is also printed. This number is of no use by
|
||||||
|
itself, except to explain why you may get multiple disagreement
|
||||||
|
between the same sets of automata.
|
||||||
|
|
||||||
|
These products tests may sometime catch errors that were not
|
||||||
|
captured by the first two tests if one non-deterministic automaton
|
||||||
|
recognize less words than what it should. If the input automata
|
||||||
|
are deterministic or the =--determinize= option is used, this test
|
||||||
|
is redundant and can be disabled. (In fact, the =--determinize=
|
||||||
|
option implies option =--product=0= to do so.)
|
||||||
|
|
||||||
|
- Consistency check:
|
||||||
|
|
||||||
|
For each $i$, the products $P_i\otimes S$ and $N_i\otimes S$
|
||||||
|
actually cover all states of $S$. Because $S$ does not have any
|
||||||
|
deadlock, any of its infinite path must be accepted by $P_i$ or
|
||||||
|
$N_i$ (or both).
|
||||||
|
|
||||||
|
An error in that case is displayed as
|
||||||
|
|
||||||
|
: error: inconsistency between P1 and N1
|
||||||
|
|
||||||
|
If =--products=N= is used with =N= greater than one, the number of
|
||||||
|
the state-space in which the inconsistency was detected is also
|
||||||
|
printed.
|
||||||
|
|
||||||
|
This test may catch errors that were not captured by the first two
|
||||||
|
tests if one non-deterministic automaton recognize less words than
|
||||||
|
what it should. If the input automata are deterministic or the
|
||||||
|
=--determinize= option is used, this test is redundant and can be
|
||||||
|
disabled. (In fact, the =--determinize= option implies option
|
||||||
|
=--product=0= to do so.)
|
||||||
|
|
||||||
|
The above checks are similar to those that are performed by [[http://www.tcs.hut.fi/Software/lbtt/][LBTT]],
|
||||||
|
except for the complemented intersection check, which is only done in
|
||||||
|
=ltlcross=.
|
||||||
|
|
||||||
|
If any problem was reported during the translation of one of the
|
||||||
|
formulas, =ltlcheck= will exit with an exit status of =1=. Statistics
|
||||||
|
(if requested) are output nonetheless, and include any faulty
|
||||||
|
automaton as well.
|
||||||
|
|
||||||
* Getting statistics
|
* Getting statistics
|
||||||
|
|
||||||
Detailed statistics about the result of each translation, and the
|
Detailed statistics about the result of each translation, and the
|
||||||
|
|
@ -592,15 +717,15 @@ configurations, and the strings =ltl2tgba -s --small %f >%O= and
|
||||||
ltlcross -f a -f Ga 'ltl2tgba -s --small %f >%O' 'ltl2tgba -s --deter %f >%O' --csv
|
ltlcross -f a -f Ga 'ltl2tgba -s --small %f >%O' 'ltl2tgba -s --deter %f >%O' --csv
|
||||||
#+END_SRC
|
#+END_SRC
|
||||||
#+RESULTS:
|
#+RESULTS:
|
||||||
: "formula","tool","exit_status","exit_code","time","states","edges","transitions","acc","scc","nonacc_scc","terminal_scc","weak_scc","strong_scc","nondet_states","nondet_aut","terminal_aut","weak_aut","strong_aut","product_states","product_transitions","product_scc"
|
: "formula","tool","exit_status","exit_code","time","states","edges","transitions","acc","scc","nondet_states","nondet_aut","complete_aut","product_states","product_transitions","product_scc"
|
||||||
: "(a)","ltl2tgba -s --small %f >%O","ok",0,0.043876,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4208,2
|
: "a","ltl2tgba -s --small %f >%O","ok",0,0.0129968,2,2,3,1,2,0,0,0,201,4144,2
|
||||||
: "(a)","ltl2tgba -s --deter %f >%O","ok",0,0.0432137,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4208,2
|
: "a","ltl2tgba -s --deter %f >%O","ok",0,0.0116347,2,2,3,1,2,0,0,0,201,4144,2
|
||||||
: "(!(a))","ltl2tgba -s --small %f >%O","ok",0,0.0400653,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4205,2
|
: "!(a)","ltl2tgba -s --small %f >%O","ok",0,0.0127019,2,2,3,1,2,0,0,0,201,4149,2
|
||||||
: "(!(a))","ltl2tgba -s --deter %f >%O","ok",0,0.0450417,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4205,2
|
: "!(a)","ltl2tgba -s --deter %f >%O","ok",0,0.0117374,2,2,3,1,2,0,0,0,201,4149,2
|
||||||
: "(G(a))","ltl2tgba -s --small %f >%O","ok",0,0.0429628,1,1,1,1,1,0,0,1,0,0,0,0,1,0,200,2077,1
|
: "G(a)","ltl2tgba -s --small %f >%O","ok",0,0.0126186,1,1,1,1,1,0,0,0,200,2059,1
|
||||||
: "(G(a))","ltl2tgba -s --deter %f >%O","ok",0,0.0478663,1,1,1,1,1,0,0,1,0,0,0,0,1,0,200,2077,1
|
: "G(a)","ltl2tgba -s --deter %f >%O","ok",0,0.011645,1,1,1,1,1,0,0,0,200,2059,1
|
||||||
: "(!(G(a)))","ltl2tgba -s --small %f >%O","ok",0,0.0436822,2,3,4,1,2,1,1,0,0,0,0,1,0,0,400,8442,2
|
: "!(G(a))","ltl2tgba -s --small %f >%O","ok",0,0.0129519,2,3,4,1,2,0,0,1,400,8264,2
|
||||||
: "(!(G(a)))","ltl2tgba -s --deter %f >%O","ok",0,0.039919,2,3,4,1,2,1,1,0,0,0,0,1,0,0,400,8442,2
|
: "!(G(a))","ltl2tgba -s --deter %f >%O","ok",0,0.0129941,2,3,4,1,2,0,0,1,400,8264,2
|
||||||
|
|
||||||
To present these results graphically, or even when analyzing these
|
To present these results graphically, or even when analyzing these
|
||||||
data, it might be convenient to give each configured tool a shorter
|
data, it might be convenient to give each configured tool a shorter
|
||||||
|
|
@ -610,143 +735,149 @@ form "={short name}actual command=".
|
||||||
|
|
||||||
For instance:
|
For instance:
|
||||||
#+BEGIN_SRC sh :results verbatim :exports both
|
#+BEGIN_SRC sh :results verbatim :exports both
|
||||||
ltlcross -f a -f Ga '{small} ltl2tgba -s --small %f >%O' '{deter} ltl2tgba -s --deter %f >%O' --csv
|
genltl --and-f=1..5 |
|
||||||
|
ltlcross '{small} ltl2tgba -s --small %f >%O' \
|
||||||
|
'{deter} ltl2tgba -s --deter %f >%O' --csv=ltlcross.csv
|
||||||
|
cat ltlcross.csv
|
||||||
#+END_SRC
|
#+END_SRC
|
||||||
#+RESULTS:
|
#+RESULTS:
|
||||||
: "formula","tool","exit_status","exit_code","time","states","edges","transitions","acc","scc","nonacc_scc","terminal_scc","weak_scc","strong_scc","nondet_states","nondet_aut","terminal_aut","weak_aut","strong_aut","product_states","product_transitions","product_scc"
|
#+begin_example
|
||||||
: "(a)","small","ok",0,0.0433468,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4208,2
|
"formula","tool","exit_status","exit_code","time","states","edges","transitions","acc","scc","nondet_states","nondet_aut","complete_aut","product_states","product_transitions","product_scc"
|
||||||
: "(a)","deter","ok",0,0.0429179,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4208,2
|
"F(p1)","small","ok",0,0.0138108,2,3,4,1,2,0,0,1,400,8272,3
|
||||||
: "(!(a))","small","ok",0,0.0400513,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4205,2
|
"F(p1)","deter","ok",0,0.0142178,2,3,4,1,2,0,0,1,400,8272,3
|
||||||
: "(!(a))","deter","ok",0,0.040167,2,2,3,1,2,1,1,0,0,0,0,1,0,0,201,4205,2
|
"!(F(p1))","small","ok",0,0.013972,1,1,1,1,1,0,0,0,200,2055,2
|
||||||
: "(G(a))","small","ok",0,0.0447826,1,1,1,1,1,0,0,1,0,0,0,0,1,0,200,2077,1
|
"!(F(p1))","deter","ok",0,0.0139471,1,1,1,1,1,0,0,0,200,2055,2
|
||||||
: "(G(a))","deter","ok",0,0.0439892,1,1,1,1,1,0,0,1,0,0,0,0,1,0,200,2077,1
|
"(F(p1)) & (F(p2))","small","ok",0,0.0136648,4,9,16,1,4,0,0,1,798,16533,5
|
||||||
: "(!(G(a)))","small","ok",0,0.0444007,2,3,4,1,2,1,1,0,0,0,0,1,0,0,400,8442,2
|
"(F(p1)) & (F(p2))","deter","ok",0,0.0140229,4,9,16,1,4,0,0,1,798,16533,5
|
||||||
: "(!(G(a)))","deter","ok",0,0.0396312,2,3,4,1,2,1,1,0,0,0,0,1,0,0,400,8442,2
|
"!((F(p1)) & (F(p2)))","small","ok",0,0.0144659,3,5,7,1,3,0,0,0,598,7367,4
|
||||||
|
"!((F(p1)) & (F(p2)))","deter","ok",0,0.0143098,3,5,7,1,3,0,0,0,598,7367,4
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3))","small","ok",0,0.0142109,8,27,64,1,8,0,0,1,1587,33068,34
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3))","deter","ok",0,0.0149064,8,27,64,1,8,0,0,1,1587,33068,34
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)))","small","ok",0,0.0159551,4,6,24,1,4,1,1,0,601,6171,4
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)))","deter","ok",0,0.0143288,7,19,37,1,7,0,0,0,1387,18792,33
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3)) & (F(p4))","small","ok",0,0.0152539,16,81,256,1,16,0,0,1,2727,57786,74
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3)) & (F(p4))","deter","ok",0,0.0155381,16,81,256,1,16,0,0,1,2727,57786,74
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)))","small","ok",0,0.015231,5,8,64,1,5,1,1,0,801,8468,5
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)))","deter","ok",0,0.0157937,15,65,175,1,15,0,0,0,2527,37226,73
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3)) & (F(p4)) & (F(p5))","small","ok",0,0.017919,32,243,1024,1,32,0,0,1,5330,114068,350
|
||||||
|
"(F(p1)) & (F(p2)) & (F(p3)) & (F(p4)) & (F(p5))","deter","ok",0,0.0167644,32,243,1024,1,32,0,0,1,5330,114068,350
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)) & (F(p5)))","small","ok",0,0.0187427,6,10,160,1,6,1,1,0,1000,10707,6
|
||||||
|
"!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)) & (F(p5)))","deter","ok",0,0.0183562,31,211,781,1,31,0,0,0,5130,82897,349
|
||||||
|
#+end_example
|
||||||
|
|
||||||
* Detecting problems
|
In this last example, we saved the CSV output to =ltlcross.csv= so we
|
||||||
:PROPERTIES:
|
can play with it in the next section.
|
||||||
:CUSTOM_ID: checks
|
|
||||||
:END:
|
|
||||||
|
|
||||||
If a translator exits with a non-zero status code, or fails to output
|
** Working with these CSV files in R
|
||||||
an automaton =ltlcross= can read, and error will be displayed and the
|
|
||||||
result of the translation will be discarded.
|
|
||||||
|
|
||||||
Otherwise =ltlcross= performs the following checks on all translated
|
The produced CSV should be directly readable by R's CSV input functions like
|
||||||
formulas ($P_i$ and $N_i$ designate respectively the translation of
|
=read.csv()=, =readr::read_csv()=, or =data.table::fread()=.
|
||||||
positive and negative formulas by the ith translator).
|
|
||||||
|
|
||||||
- Intersection check: $P_i\otimes N_j$ must be empty for all
|
#+BEGIN_SRC R :session :results output :exports both
|
||||||
pairs of $(i,j)$.
|
library(data.table)
|
||||||
|
dt <- fread('ltlcross.csv')
|
||||||
|
str(dt)
|
||||||
|
#+END_SRC
|
||||||
|
#+RESULTS:
|
||||||
|
#+begin_example
|
||||||
|
Classes ‘data.table’ and 'data.frame': 20 obs. of 16 variables:
|
||||||
|
$ formula : chr "F(p1)" "F(p1)" "!(F(p1))" "!(F(p1))" ...
|
||||||
|
$ tool : chr "small" "deter" "small" "deter" ...
|
||||||
|
$ exit_status : chr "ok" "ok" "ok" "ok" ...
|
||||||
|
$ exit_code : int 0 0 0 0 0 0 0 0 0 0 ...
|
||||||
|
$ time : num 0.0133 0.0133 0.0139 0.0128 0.0144 ...
|
||||||
|
$ states : int 2 2 1 1 4 4 3 3 8 8 ...
|
||||||
|
$ edges : int 3 3 1 1 9 9 5 5 27 27 ...
|
||||||
|
$ transitions : int 4 4 1 1 16 16 7 7 64 64 ...
|
||||||
|
$ acc : int 1 1 1 1 1 1 1 1 1 1 ...
|
||||||
|
$ scc : int 2 2 1 1 4 4 3 3 8 8 ...
|
||||||
|
$ nondet_states : int 0 0 0 0 0 0 0 0 0 0 ...
|
||||||
|
$ nondet_aut : int 0 0 0 0 0 0 0 0 0 0 ...
|
||||||
|
$ complete_aut : int 1 1 0 0 1 1 0 0 1 1 ...
|
||||||
|
$ product_states : int 400 400 200 200 798 798 598 598 1587 1587 ...
|
||||||
|
$ product_transitions: int 8272 8272 2055 2055 16533 16533 7367 7367 33068 33068 ...
|
||||||
|
$ product_scc : int 3 3 2 2 5 5 4 4 34 34 ...
|
||||||
|
- attr(*, ".internal.selfref")=<externalptr>
|
||||||
|
#+end_example
|
||||||
|
|
||||||
A single failing translator might generate a lot of lines of
|
Currently the data frame shows one line per couple (formula, tool).
|
||||||
the form:
|
This makes comparing tools quite difficult, as their results are on
|
||||||
|
different lines.
|
||||||
|
|
||||||
: error: P0*N1 is nonempty; both automata accept the infinite word:
|
A common transformation is to group the results of all tools on the
|
||||||
: cycle{p0 & !p1}
|
same line: using exactly one line per formula. This is easily
|
||||||
: error: P1*N0 is nonempty; both automata accept the infinite word:
|
achieved using =dcast()= from the =data.table= library.
|
||||||
: p0; !p1; cycle{p0 & p1}
|
|
||||||
: error: P1*N1 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; cycle{!p1 & !p0}
|
|
||||||
: error: P1*N2 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; !p1; cycle{p0 & p1}
|
|
||||||
: error: P1*N3 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; !p1; cycle{p0 & p1}
|
|
||||||
: error: P1*N4 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; cycle{!p1 & !p0}
|
|
||||||
: error: P2*N1 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; !p1; !p0; cycle{!p1 & !p0; p0 & !p1; !p1; !p1; p0 & !p1}
|
|
||||||
: error: P3*N1 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; !p1; !p1 & !p0; cycle{p0 & !p1}
|
|
||||||
: error: P4*N1 is nonempty; both automata accept the infinite word:
|
|
||||||
: p0; !p1; !p1 & !p0; cycle{p0 & !p1}
|
|
||||||
|
|
||||||
In this example, translator number =1= looks clearly faulty
|
#+BEGIN_SRC R :session :results output :exports both
|
||||||
(at least the other 4 translators do not contradict each other).
|
dt2 <- dcast(dt, formula ~ tool, value.var=names(dt)[-(1:2)], sep=".")
|
||||||
|
str(dt2)
|
||||||
|
#+END_SRC
|
||||||
|
|
||||||
Examples of infinite words that are accepted by both automata
|
#+RESULTS:
|
||||||
always have the form of a lasso: a (possibly empty) finite prefix
|
#+begin_example
|
||||||
followed by a cycle that should be repeated infinitely often.
|
Classes ‘data.table’ and 'data.frame': 10 obs. of 29 variables:
|
||||||
The cycle part is denoted by =cycle{...}=.
|
$ formula : chr "!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)) & (F(p5)))" "!((F(p1)) & (F(p2)) & (F(p3)) & (F(p4)))" "!((F(p1)) & (F(p2)) & (F(p3)))" "!((F(p1)) & (F(p2)))" ...
|
||||||
|
$ exit_status.deter : chr "ok" "ok" "ok" "ok" ...
|
||||||
|
$ exit_status.small : chr "ok" "ok" "ok" "ok" ...
|
||||||
|
$ exit_code.deter : int 0 0 0 0 0 0 0 0 0 0
|
||||||
|
$ exit_code.small : int 0 0 0 0 0 0 0 0 0 0
|
||||||
|
$ time.deter : num 0.0174 0.0149 0.0141 0.0136 0.0128 ...
|
||||||
|
$ time.small : num 0.0171 0.0155 0.0152 0.0146 0.0139 ...
|
||||||
|
$ states.deter : int 31 15 7 3 1 4 8 16 32 2
|
||||||
|
$ states.small : int 6 5 4 3 1 4 8 16 32 2
|
||||||
|
$ edges.deter : int 211 65 19 5 1 9 27 81 243 3
|
||||||
|
$ edges.small : int 10 8 6 5 1 9 27 81 243 3
|
||||||
|
$ transitions.deter : int 781 175 37 7 1 16 64 256 1024 4
|
||||||
|
$ transitions.small : int 160 64 24 7 1 16 64 256 1024 4
|
||||||
|
$ acc.deter : int 1 1 1 1 1 1 1 1 1 1
|
||||||
|
$ acc.small : int 1 1 1 1 1 1 1 1 1 1
|
||||||
|
$ scc.deter : int 31 15 7 3 1 4 8 16 32 2
|
||||||
|
$ scc.small : int 6 5 4 3 1 4 8 16 32 2
|
||||||
|
$ nondet_states.deter : int 0 0 0 0 0 0 0 0 0 0
|
||||||
|
$ nondet_states.small : int 1 1 1 0 0 0 0 0 0 0
|
||||||
|
$ nondet_aut.deter : int 0 0 0 0 0 0 0 0 0 0
|
||||||
|
$ nondet_aut.small : int 1 1 1 0 0 0 0 0 0 0
|
||||||
|
$ complete_aut.deter : int 0 0 0 0 0 1 1 1 1 1
|
||||||
|
$ complete_aut.small : int 0 0 0 0 0 1 1 1 1 1
|
||||||
|
$ product_states.deter : int 5130 2527 1387 598 200 798 1587 2727 5330 400
|
||||||
|
$ product_states.small : int 1000 801 601 598 200 798 1587 2727 5330 400
|
||||||
|
$ product_transitions.deter: int 82897 37226 18792 7367 2055 16533 33068 57786 114068 8272
|
||||||
|
$ product_transitions.small: int 10707 8468 6171 7367 2055 16533 33068 57786 114068 8272
|
||||||
|
$ product_scc.deter : int 349 73 33 4 2 5 34 74 350 3
|
||||||
|
$ product_scc.small : int 6 5 4 4 2 5 34 74 350 3
|
||||||
|
- attr(*, ".internal.selfref")=<externalptr>
|
||||||
|
- attr(*, "sorted")= chr "formula"
|
||||||
|
#+end_example
|
||||||
|
|
||||||
- Complemented intersection check. If $P_i$ and $N_i$ are
|
Using the above form, it is easy to compare two tools on some given
|
||||||
deterministic, =ltlcross= builds their complements, $Comp(P_i)$
|
measurement, as we just need to plot two columns. For example to
|
||||||
and $Comp(N_i)$, and then ensures that $Comp(P_i)\otimes
|
compare the number of states produced by the two configurations of
|
||||||
Comp(N_i)$ is empty. If only one of them is deterministic, for
|
=ltl2tgba= for each formula, we just need to plot column
|
||||||
instance $P_i$, we check that $P_j\otimes Comp(P_i)$ for all $j
|
=dt2$state.small= against =dt2$state.deter=.
|
||||||
\ne i$; likewise if it's $N_i$ that is deterministic.
|
|
||||||
|
|
||||||
By default this check is only done for deterministic automata,
|
#+BEGIN_SRC R :session :results output graphics :width 5 :height 5 :file ltlcross-r.svg :exports both
|
||||||
because complementation is relatively cheap is that case (at least
|
library(ggplot2)
|
||||||
it is cheap for simple acceptance conditions). Using option
|
ggplot(dt2, aes(x=states.small, y=states.deter)) +
|
||||||
=--determinize=, =ltlcross= can be instructed to perform
|
geom_abline(colour='white') + geom_point()
|
||||||
complementation of non-deterministic automata as well, ensuring
|
#+END_SRC
|
||||||
precise equivalence checks between all automata. However be aware
|
|
||||||
that this determinization + complementation may generate large
|
|
||||||
automata.
|
|
||||||
|
|
||||||
When validating a translator with =ltlcross= without using the
|
#+RESULTS:
|
||||||
=--determinize= option we highly recommend to include a translator
|
[[file:ltlcross-r.svg]]
|
||||||
with good deterministic output to augment test coverage. Using
|
|
||||||
'=ltl2tgba -lD %f >%O=' will produce deterministic automata for
|
|
||||||
all obligation properties and many recurrence properties. Using
|
|
||||||
'=ltl2dstar --ltl2nba=spin:pathto/ltl2tgba@-Ds %L %O=' will
|
|
||||||
systematically produce a deterministic Rabin automaton (that
|
|
||||||
=ltlcross= can complement easily).
|
|
||||||
|
|
||||||
- Cross-comparison checks: for some state-space $S$,
|
|
||||||
all $P_i\otimes S$ are either all empty, or all non-empty.
|
|
||||||
Similarly all $N_i\otimes S$ are either all empty, or all non-empty.
|
|
||||||
|
|
||||||
A cross-comparison failure could be displayed as:
|
We should probably print the formulas for the cases where the two
|
||||||
|
sizes differ.
|
||||||
|
|
||||||
: error: {P0,P2} disagree with {P1} when evaluating the state-space
|
#+BEGIN_SRC R :session :results output graphics :width 5 :height 5 :file ltlcross-r2.svg :exports both
|
||||||
: the following word(s) are not accepted by {P1}:
|
ggplot(dt2, aes(x=states.small, y=states.deter)) +
|
||||||
: P0 accepts: p0 & !p1 & !p2 & p3; p0 & p1 & !p2 & p3; p0 & p1 & p2 & p3; cycle{p0 & p1 & p2 & p3; p0 & p1 & !p2 & !p3; p0 & p1 & p2 & !p3; p0 & p1 & !p2 & !p3}
|
geom_abline(colour='white') + geom_point() +
|
||||||
: P2 accepts: p0 & !p1 & !p2 & p3; cycle{p0 & p1 & !p2 & !p3; p0 & p1 & p2 & p3; p0 & p1 & !p2 & p3}
|
geom_text(data=subset(df2, states.small != states.deter),
|
||||||
|
aes(label=formula), hjust=0, nudge_x=.5)
|
||||||
|
#+END_SRC
|
||||||
|
|
||||||
If =--products=N= is used with =N= greater than one, the number of
|
#+RESULTS:
|
||||||
the state-space is also printed. This number is of no use by
|
[[file:ltlcross-r2.svg]]
|
||||||
itself, except to explain why you may get multiple disagreement
|
|
||||||
between the same sets of automata.
|
|
||||||
|
|
||||||
These products tests may sometime catch errors that were not
|
|
||||||
captured by the first two tests if one non-deterministic automaton
|
|
||||||
recognize less words than what it should. If the input automata
|
|
||||||
are deterministic or the =--determinize= option is used, this test
|
|
||||||
is redundant and can be disabled. (In fact, the =--determinize=
|
|
||||||
option implies option =--product=0= to do so.)
|
|
||||||
|
|
||||||
- Consistency check:
|
|
||||||
|
|
||||||
For each $i$, the products $P_i\otimes S$ and $N_i\otimes S$
|
|
||||||
actually cover all states of $S$. Because $S$ does not have any
|
|
||||||
deadlock, any of its infinite path must be accepted by $P_i$ or
|
|
||||||
$N_i$ (or both).
|
|
||||||
|
|
||||||
An error in that case is displayed as
|
|
||||||
|
|
||||||
: error: inconsistency between P1 and N1
|
|
||||||
|
|
||||||
If =--products=N= is used with =N= greater than one, the number of
|
|
||||||
the state-space in which the inconsistency was detected is also
|
|
||||||
printed.
|
|
||||||
|
|
||||||
This test may catch errors that were not captured by the first two
|
|
||||||
tests if one non-deterministic automaton recognize less words than
|
|
||||||
what it should. If the input automata are deterministic or the
|
|
||||||
=--determinize= option is used, this test is redundant and can be
|
|
||||||
disabled. (In fact, the =--determinize= option implies option
|
|
||||||
=--product=0= to do so.)
|
|
||||||
|
|
||||||
The above checks are similar to those that are performed by [[http://www.tcs.hut.fi/Software/lbtt/][LBTT]],
|
|
||||||
except for the complemented intersection check, which is only done in
|
|
||||||
=ltlcross=.
|
|
||||||
|
|
||||||
If any problem was reported during the translation of one of the
|
|
||||||
formulas, =ltlcheck= will exit with an exit status of =1=. Statistics
|
|
||||||
(if requested) are output nonetheless, and include any faulty
|
|
||||||
automaton as well.
|
|
||||||
|
|
||||||
* Miscellaneous options
|
* Miscellaneous options
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue