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

org: clarify that ltl2tgba does not only output TGBA

Browse source 
* doc/org/tools.org: Adjust the link to ltl2tgba.org.
* doc/org/ltl2tgba.org: Also point out that --generic and --parity can
be used without --deterministic.
* bin/ltl2tgba.cc, bin/spot.cc: Adjust help text.
This commit is contained in:
Alexandre Duret-Lutz 2018-06-27 16:49:31 +02:00
parent 90e8cb9d2d
commit 4235b007f3
4 changed files with 11 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

4
bin/ltl2tgba.cc
View file

@ -40,10 +40,10 @@
#include <spot/misc/timer.hh>
static const char argp_program_doc[] ="\
Translate linear-time formulas (LTL/PSL) into Büchi automata.\n\n\
Translate linear-time formulas (LTL/PSL) into various types of automata.\n\n\
By default it will apply all available optimizations to output \
the smallest Transition-based Generalized Büchi Automata, \
in GraphViz's format.\n\
output in the HOA format.\n\
If multiple formulas are supplied, several automata will be output.";

6
bin/spot.cc
View file

@ -1,6 +1,6 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2013, 2014, 2015, 2016, 2017 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
// Copyright (C) 2013-2018 Laboratoire de Recherche et Développement
// de l'Epita (LRDE).
//
// This file is part of Spot, a model checking library.
//
@ -41,7 +41,7 @@ static const argp_option options[] =
{ DOC("randaut", "Generate random ω-automata.") },
{ DOC("genaut", "Generate ω-automata from scalable patterns.") },
{ DOC("ltl2tgba", "Convert LTL or PSL into variants of Transition-based "
"Generalized Büchi Automata.") },
"Generalized Büchi Automata, and to other types of automata.") },
{ DOC("ltl2tgta", "Convert LTL or PSL into variants of Transition-based "
"Generalized Testing Automata.") },
{ DOC("autfilt", "Filter, convert, and transform ω-automata.") },

5
doc/org/ltl2tgba.org
View file

@ -8,7 +8,7 @@ This tool translates LTL or PSL formulas into different types of
automata.
The inner algorithm produces Transition-based Generalized Büchi
Automata, hence the name of the tools, but =ltl2tgba= has grown and
Automata, hence the name of the tool, but =ltl2tgba= has grown and
now offers several options to adjust the type of automaton output.
Those options will be covered in more detail below, but here is
a quick summary:
@ -23,6 +23,9 @@ a quick summary:
- =--parity --deterministic= (or =-DP=) will produce a deterministic
automaton with parity acceptance.
(The latter two can also be used with =--deterministic=, but that is
less frequent.)
* TGBA and BA
Formulas to translate may be specified using [[file:ioltl.org][common input options for

4
doc/org/tools.org
View file

@ -42,8 +42,8 @@ corresponding commands are hidden.
- [[file:randltl.org][=randltl=]] Generate random LTL/PSL formulas.
- [[file:ltlfilt.org][=ltlfilt=]] Filter, convert, and transform LTL/PSL formulas.
- [[file:genltl.org][=genltl=]] Generate LTL formulas from scalable patterns.
- [[file:ltl2tgba.org][=ltl2tgba=]] Translate LTL/PSL formulas into Büchi automata.
- [[file:ltl2tgta.org][=ltl2tgta=]] Translate LTL/PSL formulas into Testing automata.
- [[file:ltl2tgba.org][=ltl2tgba=]] Translate LTL/PSL formulas into various types of automata.
- [[file:ltl2tgta.org][=ltl2tgta=]] Translate LTL/PSL formulas into testing automata.
- [[file:ltlcross.org][=ltlcross=]] Cross-compare LTL/PSL-to-automata translators.
- [[file:ltlgrind.org][=ltlgrind=]] List formulas similar to but simpler than a given LTL/PSL
formula.