|
NAMEltl2tgta - translate LTL/PSL formulas into Testing AutomataSYNOPSISltl2tgta [OPTION...] [FORMULA...]DESCRIPTIONTranslate linear-time formulas (LTL/PSL) into Testing Automata.By default it outputs a transition-based generalized Testing Automaton the smallest Transition-based Generalized Büchi Automata, in GraphViz's format. The input formula is assumed to be stuttering-insensitive. Automaton type:
Input options:
Options for TA and GTA creation:
Output options:
Simplification goal:
Simplification level:
Miscellaneous options:
Mandatory or optional arguments to long options are also mandatory or optional for any corresponding short options. BIBLIOGRAPHYIf you would like to give a reference to this tool in an article, we suggest you cite the following paper:
REPORTING BUGSReport bugs to <spot@lrde.epita.fr>.COPYRIGHTCopyright © 2022 Laboratoire de Recherche et Développement de l'Epita. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>.This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. SEE ALSOspot-x(7)
Visit the GSP FreeBSD Man Page Interface. |