hi!
With the aid of SPOT I am developing a counter-example guided synthesizer
in python. See [1] if interested for details.
My question is:
I am trying to parse twa_run in python,
namely, parse the labels of the each step (`spot.impl.step`).
Is there a python way to walk through BDD?
(The label is a simple cube expressed in BDD, and I need to convert it into
my internal structure)
(yes, this is rather a question about python interface for buddy)
(no, that is not feature request:) if not possible, I will simply print the
label and parse the string, that is not crucial)
[1]
The idea is
- guess the model,
- then model check it and get a counter-example
- then encode the counter-example into the "guesser" (which uses an SMT
solver)
thanks,
Ayrat
Hi,
there is a tiny inconsistency in man genaut. For the families from Löding's
paper there is
... 4N states ... less than n! states.
I guess the n and N should share their case.
Best,
Fanda
Hi,
the manual says in the section DESCRIPTION:
The list of automata to use should be supplied on standard input, or using
the -f or -F options.
However, the tool knows no -f option.
Fanda
