UP | HOME

DSTAR2TGBA

Table of Contents

NAME

dstar2tgba − convert Rabin or Streett automata into B??chi automata

SYNOPSIS

dstar2tgba [OPTION...] [FILENAMES...]

DESCRIPTION

Convert Rabin and Streett automata into B??chi automata.

This reads the output format of ltl2dstar and will output a Transition−based Generalized B??chi Automata in GraphViz’s format by default. If multiple files are supplied (one automaton per file), several automata will be output.

Input:

−F, −−file=FILENAME

process the automaton in FILENAME

Output automaton type:

−B, −−ba

B??chi Automaton (with state−based acceptance)

−M, −−monitor

Monitor (accepts all finite prefixes of the given property)

−−tgba

Transition−based Generalized B??chi Automaton (default)

Output format:

−8, −−utf8

enable UTF−8 characters in output (ignored with −−lbtt or −−spin)

−−check[=PROP]

test for the additional property PROP and output the result in the HOA format (implies −H). PROP may be any prefix of ’all’ (default), ’unambiguous’, or ’stutter−invariant’.

−−dot[=1|a|b|B|c|e|f(FONT)|h|n|N|o|r|R|s|t|v]

GraphViz’s format (default). Add letters for (1) force numbered states, (a) acceptance display, (b) acceptance sets as bullets, (B) bullets except for B??chi/co−B??chi automata, (c) force circular nodes, (e) force elliptic nodes, (f(FONT)) use FONT, (h) horizontal layout, (v) vertical layout, (n) with name, (N) without name, (o) ordered transitions, (r) rainbow colors for acceptance sets, (R) color acceptance sets by Inf/Fin, (s) with SCCs, (t) force transition−based acceptance.

−H, −−hoaf[=i|s|t|m|l]

Output the automaton in HOA format. Add letters to select (i) use implicit labels for complete deterministic automata, (s) prefer state−based acceptance when possible [default], (t) force transition−based acceptance, (m) mix state and transition−based acceptance, (l) single−line output

−−lbtt[=t]

LBTT’s format (add =t to force transition−based acceptance even on B??chi automata)

−−name=FORMAT

set the name of the output automaton

−o, −−output=FORMAT

send output to a file named FORMAT instead of standard output. The first automaton sent to a file truncates it unless FORMAT starts with ’>>’.

−q, −−quiet

suppress all normal output

−s, −−spin[=6|c]

Spin neverclaim (implies −−ba). Add letters to select (6) Spin’s 6.2.4 style, (c) comments on states

−−stats=FORMAT

output statistics about the automaton

Any FORMAT string may use the following interpreted sequences (capitals for input, minuscules for output):

%%

a single %

%A, %a

number of acceptance sets

%C, %c

number of SCCs

%d

1 if the output is deterministic, 0 otherwise

%E, %e

number of edges

%F

name of the input file

%G, %g

acceptance condition (in HOA syntax)

%L

location in the input file

%M, %m

name of the automaton

%n

number of nondeterministic states in output

%p

1 if the output is complete, 0 otherwise

%r

processing time (excluding parsing) in seconds

%S, %s

number of states

%T, %t

number of transitions

%w

one word accepted by the output automaton

Translation intent:

−a, −−any

no preference, do not bother making it small or deterministic

−C, −−complete

output a complete automaton (combine with other intents)

−D, −−deterministic

prefer deterministic automata

−−small

prefer small automata (default)

−S, −−state−based−acceptance, −−sbacc

define the acceptance using states

Optimization level:

−−high

all available optimizations (slow, default)

−−low

minimal optimizations (fast)

−−medium

moderate optimizations

Miscellaneous options:

−x, −−extra−options=OPTS

fine−tuning options (see spot−x (7))

−−help

print this help

−−version

print program version

Mandatory or optional arguments to long options are also mandatory or optional for any corresponding short options.

BIBLIOGRAPHY

1.

<http://www.ltl2dstar.de/docs/ltl2dstar.html>

Documents the output format of ltl2dstar.

2.

Chistof L??ding: Mehods for the Transformation of ??-Automata: Complexity and Connection to Second Order Logic. Diploma Thesis. University of Kiel. 1998.

Describes various tranformations from non-deterministic Rabin and Streett automata to B??chi automata. Slightly optimized variants of these transformations are used by dstar2tgba for the general cases.

3.

Sriram C. Krishnan, Anuj Puri, and Robert K. Brayton: Deterministic ??-automata vis-a-vis Deterministic B??chi Automata. ISAAC’94.

Explains how to preserve the determinism of Rabin and Streett automata when the property can be repreted by a Deterministic automaton. dstar2tgba implements this for the Rabin case only. In other words, translating a deterministic Rabin automaton with dstar2tgba will produce a deterministic TGBA or BA if such a automaton exists.

4.

Souheib Baarir and Alexandre Duret-Lutz: Mechanizing the minimization of deterministic generalized B??chi automata. Proceedings of FORTE’14. LNCS 8461.

Explains the SAT-based minimization techniques that can be used (on request only) by dstar2tgba to minimize deterministic B??chi automata.

REPORTING BUGS

Report bugs to <spot@lrde.epita.fr>.

COPYRIGHT

Copyright © 2015 Laboratoire de Recherche et D??veloppement de l’Epita. License GPLv3+: GNU GPL version 3 or later.
This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law.

SEE ALSO

spot-x(7), autfilt(1)