How to implement a RESTful resource for a state machine or finite automata

The update action (PUT method) is not appropriate because PUT is suppose to be idempotent. The only this would be possible is if the state was sent as part of the representation. This is inconsistet with an “event”. Is this correct? Correct. Since, events aren’t idempotent, then the a POST must be used. But, to … Read more

What is the difference between state machine and workflow?

Workflow and state machines are defined nicely on wikipedia. I’m guessing you’re getting the term State Machine Workflow from this page. .NET seems to support different ways of modeling workflows (which are just some defined steps in a complex human task). A state machine (which is a map of states with transitions between them) would … Read more

Is there a difference between a “finite state machine” and a “state machine”?

I’m not sure I understand if there is a difference between a finite state machine and a state machine? Am I thinking about this too hard? Yes, you are thinking about it too hard. 🙂 It depends on context. Obviously, taken literally, the term “finite state machine” indicates a finite number of states, while “state … Read more

Comparison between Stateless (on google code) and Windows Workflow [closed]

As I work through this, I’ll try to list some of the things I’m finding. Most will likely be a bit superficial from an analysis standpoint (especially since I’m new to both frameworks), but hopefully it will help someone out. Stateless Pros open source syntactically concise and easy to read pretty good examples in the … Read more

Algorithm for implementing C# yield statement

The particular code sample you are looking at involves a series of transformations. Please note that this is an approximate description of the algorithm. The actual names used by the compiler and the exact code it generates may be different. The idea is the same, however. The first transformation is the “foreach” transformation, which transforms … Read more

Is there a programming language with built-in state machine construct?

Ragel is a state machine language. IOW, it’s not a language that also supports state machines, it’s a language that only supports state machines. Which obviously means that it’s not Turing-complete, but who needs that? More precisely, Ragel is a state machine compiler, which takes a description of a state machine in a regexp-like language … Read more

tech