The abstraction a B s, z) of all configurations (1, z) where z is odd is the abstract state (1, B) and abstraction a B s, z) of all configurations (1, z) where z is even is the abstract state (1, ~B).
Thus, all configurations from state 2 under the input a take the machine to state 1 and lead to valuations of w that still satisfy B. Thus, for state 1, there is the only abstract state (1, B) in the abstraction FSM.
Predicate derived based on states of an abstraction FSM M B. Splitting valuations can also be done based on selected state(s) of an abstraction FSM M B. Given M B, select an abstract state r = (s r, a) such that r has many outgoing transitions under a (parameterized) input (x, p x).
Consider B = {B 1, B 2} such that configurations in C′ are mapped into the abstract state S′ = (0, B 1, ~B 2) of the FSM abstraction and configurations in C′′ are mapped into the abstract S′′ = (0, ~B 1, B 2).
Dewitt Godfrey's large, curving, horizontal steel sculpture suggests an equal, if more abstract, state of collapse, and Abby Pervil's "Car Tomb" is just that.
The idea is that a sentence starts in an almost unrecognizably abstract state, as a bare, treelike structure quite different from the ones some will recall from schoolroom diagraming.
The Abstract State Machine Language, AsmL, is a novel executable specification language based on the theory of Abstract State Machines.
Now, consider state 1 of M 2 and a corresponding abstract state (1, B).
For this purpose, abstract state machines are used as a modelling tool.
