Then, How can I generate word prefixes from the power-set of AP which are arbitrarily large? Also, it may not be necessary that there is a cycle in the alive part (prefix). the prefix may has two or more steps and then I append cycle{!alive} and then parse
it to the automaton.
Thanks and Regards,
Hashim Ali
Research Assistant
Laboratory for Cyber-Physical Networks and Systems (Cyphynets)
Lahore University of Management Sciences (LUMS)
From: Alexandre Duret-Lutz <adl@lrde.epita.fr> Sent: 27 March 2019 14:30 To: hashim ali Cc: spot@lrde.epita.fr Subject: Re: [Spot] Generate Words for verification
On Wed, Mar 27, 2019 at 7:46 AM hashim ali <hashim_ali94@outlook.com> wrote:
>
> Hi,
> Thank you for writing back. I am doing exactly like this. I append cycle{!alive} to my finite word before parsing it to an automaton. but I don't know what should be the length of my prefix i.e. how many steps it should have. I guess its more of a theoretical
question, so can you direct me to some source where I can read on this.
>
> For example, if I have a one state automaton my prefix would have only one step e.g. a&b and for two state automaton it may have two steps like this a&b ; a&!b. Is there any method that I can calculate the number of steps.
Why do you assume that such a bound exists? If your automaton has any
cycle in the alive part it will recognize words that are arbitrary
large.