-
1 action table
"A set of rules, stored as an ADO Recordset, that define how workflow items can change state. Each row in an action table represents a possible state transition in the workflow."
См. также в других словарях:
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … Wikipedia
State diagram — State diagrams is a diagram used in the field of computer science, representing the behavior of a system, which is composed of a finite number of states. There are many forms of state diagrams, which differ slightly and have different semantics.… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Virtual finite state machine — The virtual finite state machine (VFSM) is a concept promoted by [http://www.stateworks.com SW Software] and implemented in their StateWORKS product. A VFSM is a finite state machine (FSM) defined in a virtual environment. The VFSM concept… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Transition To War — (TTW) is a NATO military term [cite web title=NATO C3 Technical Architecture work=North Atlantic Treaty Organisation url=http://nc3ta.nc3a.nato.int/website/book.asp?cl=no menuid=13 page=acronyms%2Facronyms T.html accessdate=2006 04 21] referring… … Wikipedia
transition element — Chem. any element in any of the series of elements with atomic numbers 21 29, 39 47, 57 79, and 89 107, that in a given inner orbital has less than a full quota of electrons. Also called transition metal. [1920 25] * * * Any chemical element with … Universalium
Transition metal — The term transition metal (sometimes also called a transition element) has two possible meanings: The IUPAC definition[1] states that a transition metal is an element whose atom has an incomplete d sub shell, or which can give rise to cations… … Wikipedia