Hi,
A state machine is just a while loop with a case in it. The selected case is
determined by a shift register, that was filled by the previous state... An
example will clear this up.
If you search for "state machine" in the developer zone, www.ni.com, you'll
find lots of examples. The first you'll find:
http://zone.ni.com/devzone/conceptd.nsf/webmain/8C4EECACF084F8E986256802007B9186?opendocument
This one is ok, but I recommend using a "Type Def" enumerator instead of a
number or string.
You could consider using an array of states, so each state can add a number
of other states to the queue (queued state machine). This can get ugly (esp.
if you want to document it later on), but it is very flexible.
In LV7 you can make a state machine usi
ng an event structure instead of a
case structure. This can be handy, but can also cause a lot of problems. Try
a normal state machine first, then a queued state machine.
Regards,
Wiebe.
"IBI" wrote in message
news:506500000005000000497C0100-1079395200000@exchange.ni.com...
> You you are right because it gets complexer, but what do you mean with
> state machine. could you send it to me so that i can study it.
>
> Thank you very much