I have defined a finite state machine: pb with button : they need to be click twice

I have defined a finite state machine and also defined a call to a C dll enabling to kill processus since in my state machine I have to sequence several exe and being able to interupt them (This is the goal of mu manageProc dll)
for the moment I make my integration test with the notepad.exe process
the create and kill seems to work
but I have problem wth my finite state machine I need to click twice on the differnts button for a given state to be really effective
I have also used glabal variable and an event controller ( without that I was unable to get ffedback oo buuton click
So my question are
Is my problem due to the use of a shift register
Please tell me if you need other file to understand my problem
Regards
Thibaut
Attachments:
Spectro State MAchine .vi ‏77 KB

Thibaut,
You should put the event structure into its own parallel while loop rather than sharing the loop with the state machine. Typically the terminals of the controls will be placed inside the event case where they are read. At least inside the loop.
Run your VI with execution highlighting on (the light bulb on the diagram toolbar). This will show you how dataflow works.
You probably do not need most of your global variables. Appropriate use of shift registers and wires would eliminate them.
Lynn

Similar Messages

Need help setting up a Finite State Machine in BlueJ

Hey all, I joined these forums to hopefully help me catch up with my Java skills. I haven't programmed in Java for almost a year, and the class I'm in now does little for review so I'm rusty to say the least. The assignment we were given recently is to create a Finite State Machine resembling a gumball machine. This are basically the requirements given:
The operation of the gumball machine is simple. It takes a quarter to get a gumball dispensed. The customer needs to deposit a quarter and turn the crank, and a gumball will be dispensed if the machine contains one or more gumballs.
Design steps:
There are a number of states: No_Quarter, Has_Quarter, Gumball_Sold, Out_of_Gumballs
Create an instance variable to hold the current state and define values for each of the states.
All the actions that can happen in the system are: insert_quarter, ejects_quarter, turns_crank, dispense_gumball, and refill_gumballs. The action dispense_gumball is an internal action the machine invokes when it reaches the Gumball_Sold state.
Create a class that acts as the state machine. For each action, create a method that uses conditional statements to determine what behavior is appropriate in each state.
Write a test program to test the GumballMachine class. You consider not just normal operations i.e. insert a quarter, turn the crank; but also operations such as insert a quarter, eject the quarter, turn the crank. Or what if you turn the crank twice after insert one quarter. Or what if you insert two quarters in a row.
Now trust me, I'm not asking for someone to come here with a hunk of code and say, ok use this, and it's done. What I'm here for is hopefully someone can walk me through the right thought process of how to implement the states, and where/how to include the actions to go along with the states. We're to use BlueJ to write the code, and I'm still pretty unfamiliar with its arrow system that tells Test Programs to use the linked class(es).
Thanks for any help in advance, and for what it's worth, speedy responses are especially appreciated!

Did you upload everything to your server? Did you perform the compatibility check?
FormCaptcha’s requirements:
PHP 4.0 or later.
GD Library for PHP, version 2.0 or greater (it's installed on most web servers but it may not be enabled).
The page that processes the form must have .PHP extension.
Tip: If you want to be sure that your web server supports this captcha tool, then you can download and test our free captcha compatibility check. This is a script that checks if your web server can generate captcha images and perform the captcha validation.
Nancy O.
Alt-Web Design & Publishing
Web | Graphics | Print | Media Specialists
http://alt-web.com/

Finite state machine using jsf ?

I am building an online payment module and would like to implement it using a finite state machine. I am hoping that someone may give us advice on how to build it with jsf.
Firstly, I am just beginning with jsf.
Here is the example: Let's say that in the module there are 7 possible states that the user may be in, each represented by a jsp. I cannot decide where to manage state transitions. One option is to change states in the backer bean of every state, but that is dispersing transition logic across all my backer beans. The other option I can see is to have one single actionListener and have all action events pass through the 'processAction' method, keeping all the state management logic in one place.
Please comment on either of these two approaches...or any alternatives :)
Thanks in advance !
Mark

Sounds like a state machine in combination with a decorator on the ViewHandler might do the trick.
Off the top of my head I'd suggest creating a managed bean in session scope that keeps track of the state in the user's session (the state machine). Check the bean from the ViewHandler decorator when a page is requested and direct the user to the correct page if they are trying to navigate to a page that conflicts with what is allowed for their current state.
Your actionlisteners or action methods could change the user's state in the session as they process their actions.
http://forum.java.sun.com/thread.jsp?forum=427&thread=502322
The above thread discusses the use of a decorator to control navigation for authentication purposes, but it should be adaptable to this use.
Is that plausable or am I smoking crack? :-)
-jeff howard

Finite state machines

hi
this is a bit of a stab in the dark but does anyone have experience in implementing evolving finite state machines in java. im trying to build a system of creatures who are controlled by an fsm and who compete for a limited resource. i want to control their physiology with the fsm and have them evolve more complicated competetive strategies. i just want someone to throw some ideas at and ask some questions. can anyone help?
julian.

sounds interesting. i've heard a lot about finite state machines but i've never understood what exacly is an finite state machine. we german call it "endlicher automat". is it the same as an turing machine? i have never studied computer science so i have no idea what this terms really mean.

Finite State Machine

hello dear coders. I'm a software engineering student and i have an assignment to create an Elevator Simulator using various programming patterns.
One of them is the an advance form of the State Pattern from Gang of Fours, the Finite State Machine.
On assignment delivery i have to justify every choice i made in implementing the patterns. I have my understanding of the FSM ( finite state machine) but i don't know if it's even near the correct form.
I'll post the classes I've made for a elevator simulator, and i would appreciate if you give me your opinion and state what i could improve and why.
I'll post also the possible state changes for the simulator requested by teacher.
States : [http://img201.imageshack.us/img201/6150/stateskz6.th.jpg]
Since they are in portuguese i'll give you the translation:
Porta Fechada = Door Closed
Porta Aberta = Door Open
Ascendente = Going up
Descendente = Going down
Parado = Stopped ( or idle )
class : StateMachine
* @author bruno
public class StateMachine {
    private AbstractState state;
    private AbstractState globalState;
    private AbstractState previousState;
    public StateMachine(AbstractState state, AbstractState globalState, AbstractState previousState) {
        this.state = state;
        this.globalState = globalState;
        this.previousState = previousState;
    public StateMachine() {
        this.state = new StateStopped();
        this.globalState = new StateGoingUp();
        this.previousState = new StateGoingUp();
    public void update() {
        if (state instanceof StateDoorClosed) {
            if (previousState instanceof StateGoingUp || previousState instanceof StateGoingDown) {
                this.changeState(this.getState().open());
            } else if (previousState instanceof StateDoorOpen || previousState instanceof StateDoorClosed) {
                this.changeState(this.getState().execute());
        } else if (state instanceof StateStopped && !(globalState instanceof StateStopped)) {
            if (globalState instanceof StateGoingUp) {
                this.changeState(this.getState().up());
            } else {
                this.changeState(this.getState().down());
        } else {
            this.changeState(this.getState().execute());
    public AbstractState getState() {
        return state;
    public AbstractState getGlobalstate() {
        return globalState;
    public void setState(AbstractState state) {
        this.state = state;
    public void setGlobalState(AbstractState globalState) {
        this.globalState = globalState;
    public AbstractState getPreviousState() {
        return previousState;
    public void setPreviousState(AbstractState previousState) {
        this.previousState = previousState;
    public void changeState(AbstractState newState) {
        this.setPreviousState(state);
        this.setState(newState);
}class : AbstractState
* @author bruno
public abstract class AbstractState {
    protected AbstractState state;
    public abstract AbstractState execute();
    public abstract AbstractState up();
    public abstract AbstractState down();
    public abstract AbstractState open();
    public abstract AbstractState close();
    public AbstractState getState() {
        return state;
    public AbstractState(AbstractState state) {
        this.state = state;
    public AbstractState() {
        this.state = this;
    public void setState(AbstractState state) {
        this.state = state;
}I omitted the concrete State Classes because of length, if you would like me to post them as-well please, don't hesitate to ask.
Sorry for the bad English and for the length of the post.
THANK YOU IN ADVANCE!

>
Two things with this code:
public void update() {
if (state instanceof StateDoorClosed) {
if (previousState instanceof StateGoingUp || previousState instanceof StateGoingDown) {
this.changeState(this.getState().open());
} else if (previousState instanceof StateDoorOpen || previousState instanceof StateDoorClosed) {
this.changeState(this.getState().execute());
} else if (state instanceof StateStopped && !(globalState instanceof StateStopped)) {
if (globalState instanceof StateGoingUp) {
this.changeState(this.getState().up());
} else {
this.changeState(this.getState().down());
} else {
this.changeState(this.getState().execute());
}Firstly, that doesn't look like a finite state machine. In a FSM the next state depends on the current state and the input it receives, whereas your machine it depends on the previous state and the global state, and no input.
Secondly, almost always if you're using instanceof to change behaviour, you're doing something wrong. It's useful for testing data you've received from a general purpose channel, such as some serialisation mechanisms or an implementation of string formatting, but it shouldn't be in the core of classes where you've designed both sides of the contract.
Usually you implement either a general purpose method to return the next state from a state given its input, or (as you have done) provide several methods to cope with the different inputs and return the next state. So the core execution logic would be for a general transition method.
get input from outside
state = state.transition(input)or for specific methods:
get input from outside
switch input
    case open: state = state.open()
    case close: state = state.close()The diagram you posted is too small to read, but it doesn't seem to have any inputs marked on the transitions, which makes the whole thing indeterminate, unless the inputs for each transition are recorded elsewhere.
Your AbstractState has a reference to another state - why ? It should either have one state for each transition out of it, or none (for example, if you make each state instance an nested class of the machine, or use an enum for the states, they don't need anything other than a transition() method, and no fields)

Hi there I have a iPhone 3G and it was with O2 but needed to go onto 3 network so someone on my local market unlocked it and the phone was working fine until I tried to update it through iTunes and it always now stops loading towards the end with an erro

Hi there
I ha
Hi there I have a iPhone 3G and it was with O2 but needed to go onto 3 network so someone on my local market unlocked it and the phone was working fine until I tried to update it through iTunes and it always now stops loading towards the end with an error is there a way to get the phone working again please.

Shame you had the iPhone hacked as O2 usually unlock their customers iPhones happily.
We cannot discuss your problem as it is in breach of the Ts&Cs you agreed to on registering
However hint ....you have probably trashed it

State machines caveat

I have been using the state machine design pattern in programs for a
while. In this technique, it is a common practice to define boolean
switches to trigger actions in the next iteration of the machine (eg.
"TurnLaserON", "Quit", "Compute", "SetAlarm1"...). Thus, the boundary
between data and processing is easily trespassed.
This sounds to me like a possible source of errors, that should be
limited by some design rule of thumb. I tend to believe that boolean
triggers in state machines should be looked at with the same precautions
as a "GOTO" control structure.
Do you have any experience or theoretical frame to enlighten these
considerations ?
oz

Hi,
I always prefer a state machine with a state buffer. This means, every state
can, potentially, call several other states. In practice, there is a shift
register with an array of strings in it. The first string is called, and
removed. Every state can modify the buffer, so:
+ states can be put before, after or between the buffer
+ states can be removed
+ states can be filtered, sorted etc.
+ buffered states can be copied
This makes programming with state machines a lot easier. You can simply make
a state TurnLaserON, and in the calling state(s) diside what the state after
TurnLaserON has to be. This makes the program a lot clearer.
Some design rules I use (mainlly because if I don't use them, there is no
way of documenting the program):
+ states may only put states before the buffer (I call them sub states)
+ buffered states cannot be removed in a state
Using these rules, I can put the entire program on paper, without any
problem.
Still, I have to transfere information between states. This 'information'
can be a shift register with a bundle, indicators on the front panel (not
visible to the end user), a GLI, buffers, ini file reference, or whatever. I
have never found any big advantage or disadvantage for eny of them, but I
prefer indicators (mixed with buffers when convenient), because they are the
fastest to use (for me), and easiest to debug (IMO).
Regards,
Wiebe.
"O. Zimmermann" wrote in message
news:[email protected]...
>
> I have been using the state machine design pattern in programs for a
> while. In this technique, it is a common practice to define boolean
> switches to trigger actions in the next iteration of the machine (eg.
> "TurnLaserON", "Quit", "Compute", "SetAlarm1"...). Thus, the boundary
> between data and processing is easily trespassed.
>
> This sounds to me like a possible source of errors, that should be
> limited by some design rule of thumb. I tend to believe that boolean
> triggers in state machines should be looked at with the same precautions
> as a "GOTO" control structure.
>
> Do you have any experience or theoretical frame to enlighten these
> considerations ?
>
>
> oz
>

Advantages of Using Queued Message Handler vs. Standard State Machine

Hello,
What are the advantages of using a Queued Message Handler? Also, why are they more powerful than using Standard State Machines?
Thanks!

They are really just sort of an extension of a state machine. The general idea is that you have one loop doing a specific job. You then use a queue to tell it how/when to do this job. For instance, I might have a log file loop. I will send it commands to open a file, write some data, write some more data, and finally close the file. Each of those commands are coming from the queue. The beauty with this setup is that anybody that can get a reference to that queue can send the command to that loop.
So the QMH is "better" than a state machine mostly because of the decoupling of functions. In a given application, I will have a loop for log file writing, GUI updates, reading of a DAQ, instrumenet communications, server communications, etc. Trying to do all of that in a single loop state machine is a major pain in the rear end. Seperating them out makes life so much easier.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions
Unofficial Forum Rules and Guidelines

How to REpublish Custom Task Forms (InfoPath) to SharePoint 2010 State Machine Workflows

I am new to SharePoint. Sorry if answer to my question is obvious.
I've create Custom Task Form in InfoPath and publish it (File/Publish/Network Location [Form Template Path and filename='MYPROJECT/Forms/ApprovalForm.xsn'; Form template name='ApprovalForm'], in the next window I've cleared Public URL according to the articlehttp://www.codeproject.com/Articles/195348/SharePoint-2010-State-Machine-Workflows-with-Custo).
After it I've added module Forms, and added ApprovalForm.xsn from the existing items.
My xml files: Elements.xml
<Elements xmlns="http://schemas.microsoft.com/sharepoint/">
<Workflow
Name="Order New Server"
Description="My SharePoint Workflow"
Id="482cbc86-b717-4981-a49a-3cf4c89e9399"
CodeBesideClass="Myproj.OrderNewServer.OrderNewServer"
CodeBesideAssembly="$assemblyname$"
TaskListContentTypeId="0x01080100C9C9515DE4E24001905074F980F93160">
<Categories/>
<AssociationData><Data></Data></AssociationData>
<MetaData>
<AssociationCategories>List</AssociationCategories>
<Task2_FormURN>urn:schemas-microsoft-com:office:infopath:ApprovalForm:-myXSD-2012-03-09T14-11-55</Task2_FormURN>
<StatusPageUrl>_layouts/WrkStat.aspx</StatusPageUrl>
</MetaData>
</Workflow>
</Elements>
Feature.Template.xml:
<?xml version="1.0" encoding="utf-8" ?>
<Feature xmlns="http://schemas.microsoft.com/sharepoint/" ReceiverAssembly="Microsoft.Office.Workflow.Feature, Version=14.0.0.0, Culture=neutral, PublicKeyToken=71e9bce111e9429c" Receiverlass="Microsoft.Office.Workflow.Feature.WorkflowFeatureReceiver">
<Properties>
<Property Key="GloballyAvailable" Value="true" />
<Property Key="RegisterForms" Value="Forms\*.xsn"/>
</Properties>
</Feature>
My form work fine, but when I make changes and republish it, it doesn't update (I see old form). What I tryed:
IISReset
Clear all cookies and cache in IE
Retract solution, restart VS2010, reboot computer.
Change assembly number, guid.
I have no ideas, what can I try for republish my form with changes.
Thank you in advance for any suggestions.
PS: sorry for my writing. English is not my native language.
PPS: when I save new Form to new location and add it to the project, it works.

I've found how can I republish changes. But it seems more like crutch than solution, but it works:
After republishing InfoPath form, I delete file from project (DEL on ApprovalForm.xsn in Solution explorer) and after it add it again. (Add/Existing Item). And then redeploy! Hurray!
Is there any way to redeploy a Task Form directly on the server without importing it in Visual Studio again? I am using some data connections in my task form which are different for different environments (staging, dev. etc.). Seems like I've to create a separate
Workflow WSP file for each envrionment. Any comments?

Shutting down a queued event state machine with multiple parallel loops

I am trying to find the best way to shutdown a program that consists of a queued event state machine architecture with multiple parallel loops. Can anyone recommend the best way to accomplish this in my attached VI? (From browsing the forum, this seems to be a common question but I haven't found a solution that works for me.)
I welcome any other feedback on my code as well, if anyone is willing to offer it.
My Program Requirements:
If the user presses the "Shutdown" button, the program should prompt the user with "Are you sure you want to stop the program?" and then either return to the Idle state or proceed to stop the program. Additionally if there is an error, the program should prompt the user with "Clear error and continue, or Stop program?" Then either return to the Idle State or proceed to stop the program.
Details of architecture:
The program consists of 3 parallel loops: (1) an Event Handling loop that enqueues various States to a State Queue, (2) a State Machine which enters the latest state that is dequeued from the State Queue, and (3) an Error/Shutdown handling loop which processes any errors in the Error queue.
During normal Shutdown, in the Event Handling loop the "Program.Shutdown" event case executes, and the States "Shutdown" and "Idle" are added to the State Queue. In the State Machine, the "Shutdown" state is invoked. A special error code "5000" is added to the Error Queue. In the Error/Shutdown handling loop, the "5000" error triggers a prompt that asks the user if they want to stop the program. If the user chooses not to stop, a notifier StopNotif is sent to the "Shutdown" state and "Program.Shutdown" event case with the notification "Go". If the user chooses to stop, the notifier sends the notification "Stop". The Event handling loop and State Machine are terminated if they receive the notification "Stop".
In case of error, the program behaves similarly: if the user chooses to clear the error and continue, the program returns to the "Idle" state.
HOWEVER - if the user chooses to stop the program, the program stalls. The notifier that is sent to stop the Event Handling Loop and State Machine cannot be read because the Program.Shutdown event case and the Shutdown state (which contain the "Wait for Notifier" function) are not active.
I have been able to activate the Shutdown state by enqueuing it in the Error/Shutdown handling loop. But I don't know how to activate the "Program.Shutdown" event programmatically, and thereby access the "Wait for Notifier" function inside it.
I tried to place the "Wait for Notifier" function outside the event structure, but then the Event Handling loop never completes. Placing timeouts on the "Wait for Notifier" and on the Event structure makes the program work, but I want to avoid using timeouts because I don't want to turn my event-driven program into a polling-based program. I'd also like to avoid using variables or property nodes to stop the loops, because that requires creating a control/indicator for something that the user doesnt need to interact with.
Thank you!
Solved!
Go to Solution.
Attachments:
Queued event state machine parallel loops empty.vi ‏46 KB

Thanks for clarifying that, Ravens Fan.
I marked crossrulz as the solution for pointing out User Events to me.
I also adopted Ravens Fan's suggestion to keep the Shutdown procedure out of the Error Handling Loop. This has simplified the architecture by eliminating the need for Notifiers. Instead, I have used booleans in case structures to stop the Event Loop and State Machine, and Release Queue to stop the Error Handling Loop.
For reference, I'm attaching my corrected code.
Thank you to everyone who helped!
Attachments:
Queued event state machine parallel loops empty in progress.vi ‏44 KB

State Machine Demo

Hi Folks,
I am a newbiew LabVIEW developer studying & working towards my CLAD certification.
I already took LabVIEW Basics I & II and I decided to make a simple state machine (please see attached VI).
I was hopping if there is anyone out there who find a way for the VI be optimized so I can see my weakness.
ThanX in ADVANCE!!!!!
Attachments:
StateSimulatorfromEE428.vi ‏71 KB

Overly complicated and convoluted is the word.
I haven't even tried to undestand what you are juggling with all these string operations, but there's gotta be a better way!
Case 4 and 5 are identical except for a diagram constant. They can be comined into one case.
"state operation" is a control, but you are constantly writing to it via local variables. This mean it cannot be reliably operated, because the set value could be reset before it is used due to race conditions.
It is confusing that you replace the "state" of a typical state machine with a "state operation", while the "state" is actually in a string that does not really influnece operation. Whatever you have is not a state machine.
In state operation=2 you delete from the 2D string array, but later you always seem to iterate over 9 elements (one too many to begin with) in the inner while loop.
Since the 2D string array can shrink but never grow, you might stop the program once its size reaches zero.
You write to a local variable in virtually each state, it would be more reasonable to pull this local variable write before the case structure.
The attached quick modification illustrates some of the above points. This is not a finished or even reasonable program. It would need a complete rewrite.
LabVIEW Champion . Do more with less code and in less time .
Attachments:
StateSimulatorfromEE428MOD.vi ‏64 KB

Given up on State MAchines please help...

hello everyone,
I have given up on state machine.. and trying to compile this simple program...
I am unable to compile this code, and seriously at my wits end how to debug this code.. can anyone please suggest me what is wrong/???
Now on LabVIEW 10.0 on Win7
Attachments:
Drill_Rig_v001.vi ‏152 KB

Ray.R ... I am sorry... I had initially decided to perform this task using state machine... But then I quit...
And hence, I thought of using simple case structures...
This is what I want actually...
I would like to create a VI in which the start condition is a cylinder at position A. Once the position is confirmed, there is a motor which should be turned ON via LV.
Once the motor is ON, the cylinder should go to position B, once the cylinder is at position B, a counter should start... The cylinder has an attachment in the front which does a particular task
and once the task is finished, the cylinder should go back to position A and the system should shut off...
And in that process, I am totally confused and don't know what to do...
http://forums.ni.com/t5/LabVIEW/how-to-have-a-while-loop-inside-a-case-structure/td-p/1241346/page/2
this is the forum where I had been discussing about SM.... also posted my VI ter.. but posting it again here...
Now on LabVIEW 10.0 on Win7
Attachments:
Soda Vending MAchine.vi ‏211 KB

I transferred a pages file from ipad to mac (also pages) via email for editing. However received message that cannot save edited document to the mac because "trial period has expired for iwork"! I have purchased pages for both machines separately. Ideas?

I transferred a pages file from ipad to mac (also pages) via email for editing. It opened normally. However, after editing, received message that cannot save edited document to the mac because "trial period has expired for iwork"! I have purchased pages for both machines separately and presumed they would work without a hitch. Am I missing something?

It used to be that to update the trial to the licensed version with the box, you just inserted the DVD & ran the installer to convert the trial to licensed. This changed with Snow Leopard. You now need to delete the trial & then reinstall from the boxed DVD or the Mac App Store. The files to delete are the iWork ’09 folder from the main HD > Applications; the iWork ’09 folder in HD > Library > Application Support & the individual iWork application plist files found in HD > Users > (your account) > Library > Preferences for each user.
Yvan Koenig has written an AppleScript that removes the files. You can find it on his iDisk in For_iWork > iWork '09 > uninstall iWork '09.zip.

Labview State machines Edit Items

Iam using a state machines, Iam having a problem with updating new items in the state machines..
What happens when I right click on the enum attached to the shift register and try to add new item to it..
the cases change to numbers istead of actual choices..
what can I do to fix this.
Thanks

R U Sure
I can do it
Thanks & Regards,
Kunal Raithatha.
CTD - CLAD (I wish I can take off that A, and maybe use it later to replace D :-)
Easy Tip :- "To copy an image to a VI icon, drag the image file and place it on the icon
located in the upper right corner of the front panel or block diagram" ...If you know any
more reply back.
Attachments:
SK0480.vi ‏5 KB

The print driver for HP Laserjet 3380 that was print only was removed from my iMac, and now when try to download driver, it states to contact manufacturer. I have old driver on Time Machine, can I reinstall that old driver that worked?

The print driver for HP Laserjet 3380 was for print only, was removed and when I went to download from apple, it stated to contact manufacturer. I have old driver in Time Machine, how do I reinstall from Time Machine that driver that worked?

Hi,
Trible post. Please use:
http://h30434.www3.hp.com/t5/Printer-All-in-One-Install-Setup/HP-solution-center/m-p/4790405
Regards.
BH
**Click the KUDOS thumb up on the left to say 'Thanks'**
Make it easier for other people to find solutions by marking a Reply 'Accept as Solution' if it solves your problem.

I have defined a finite state machine: pb with button : they need to be click twice

Similar Messages

Maybe you are looking for