The Problem SolverWIndows Workflow Foundation
HomeShow ChangesEditPrintRecent ChangesSubscriptionsLost and FoundFind ReferencesRename



4-3-2008 17:04:4129-2-2008 20:21:2626-2-2008 03:25:2125-2-2008 22:32:0823-2-2008 03:58:27

List all versions

Finite State Machine

A finite state machine (FSM) or finite state automaton (plural: automata) is a model of behavior composed of states, transitions and actions. A state stores information about the past, i.e. it reflects the input changes from the system start to the present moment. A transition indicates a state change and is described by a condition that would need to be fulfilled to enable the transition. An action is a description of an activity that is to be performed at a given moment.

See Wikipedia

Wiki Usage

This wiki site is supposed to be a shared resource. As a shared resource everyone is encouraged to add new content or modify existing content!

Enjoy the WF wiki.

Recent Topics