alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity
spot/doc/org/genaut.org
Alexandre Duret-Lutz cc498e7080 org: run a spell checker on the documentation 
* doc/org/autcross.org, doc/org/autfilt.org, doc/org/citing.org,
doc/org/compile.org, doc/org/concepts.org, doc/org/csv.org,
doc/org/dstar2tgba.org, doc/org/genaut.org, doc/org/genltl.org,
doc/org/hierarchy.org, doc/org/hoa.org, doc/org/index.org,
doc/org/install.org, doc/org/ltl2tgba.org, doc/org/ltl2tgta.org,
doc/org/ltlcross.org, doc/org/ltlfilt.org, doc/org/ltlgrind.org,
doc/org/ltlsynt.org, doc/org/oaut.org, doc/org/randaut.org,
doc/org/randltl.org, doc/org/satmin.org, doc/org/tut.org,
doc/org/tut01.org, doc/org/tut02.org, doc/org/tut03.org,
doc/org/tut04.org, doc/org/tut10.org, doc/org/tut11.org,
doc/org/tut12.org, doc/org/tut20.org, doc/org/tut21.org,
doc/org/tut22.org, doc/org/tut23.org, doc/org/tut24.org,
doc/org/tut30.org, doc/org/tut31.org, doc/org/tut50.org,
doc/org/tut51.org, doc/org/tut52.org, doc/org/tut90.org,
doc/org/upgrade2.org: Run ispell-buffer on all these.
* bin/autfilt.cc, python/spot/__init__.py: Fix typos in
help texts noticed while spell-checking the org files.
2020-07-21 22:21:58 +02:00

2.2 KiB
Raw Blame History

genaut

This tool outputs ω-automata generated from scalable patterns.

These patterns are usually taken from the literature (see the genaut(1) man page for references).

      --ks-nca=RANGE         A co-Büchi automaton with 2N+1 states for which
                             any equivalent deterministic co-Büchi automaton
                             has at least 2^N/(2N+1) states.
      --l-dsa=RANGE          A deterministic Streett automaton with 4N states
                             with no equivalent deterministic Rabin automaton
                             of less than N! states.
      --l-nba=RANGE          A Büchi automaton with 3N+1 states whose
                             complementary Streett automaton needs at least N!
                             states.
      --m-nba=RANGE          An NBA with N+1 states whose determinization needs
                             at least N! states

By default, the output format is HOA, but this can be controlled using the common output options for automata.

For instance:

genaut --ks-nca=2 --dot

/alarsyo/spot/media/commit/20bcc216a09dafddf930e58a0bde385f0625311a/doc/org/kscobuchi2.svg

The patterns can be specified using a range of the form N (a single value), N..M (all values between N and M included), or ..M (all values between 1 and M included).

genaut --ks-nca=..5 --stats='%F=%L has %s states'
ks-nca=1 has 3 states
ks-nca=2 has 5 states
ks-nca=3 has 7 states
ks-nca=4 has 9 states
ks-nca=5 has 11 states