Virtual finite-state machine

Implementing a state machine necessitates the generation of logical conditions (state transition conditions and action conditions). In the hardware environment, where state machines found their original use, this is trivial: all signals are Boolean. In contrast state machines specified and implemented in software require logical conditions that are per se multivalued:

• Temperature could be Low, OK, High
• Commands may have several values: Init, Start, Stop, Break, Continue
• In a hierarchical control system the subordinate state machines can have many states that are used as conditions of the superior state machine

In addition input signals can be unknown due to errors or malfunctions, meaning even digital input signals (considered as classical Boolean values) are in fact 3 values: Low, High, Unknown.

A Positive Logical Algebra solves this problem via virtualization, by creating a Virtual Environment which allows specification of state machines for software using multivalued variables.

A state variable in the VFSM environment may have one or more values which are relevant for the Control—in such a case it is an input variable. Those values are the control properties of this variable. Control properties are not necessarily specific data values but are rather certain states of the variable. For instance, a digital variable could provide three control properties: TRUE, FALSE and UNKNOWN according to its possible boolean values. A numerical (analog) input variable has control properties such as: LOW, HIGH, OK, BAD, UNKNOWN according to its range of desired values. A timer can have its OVER state (time-out occurred) as its most significant control value; other values could be STOPPED or RUNNING.

Other state variables in the VFSM environment may be activated by actions—in such a case it is an output variable. For instance, a digital output has two actions: True and False. A numerical (analog) output variable has an action: Set. A timer which is both: an input and output variable can be triggered by actions like: Start, Stop or Reset.

Figure 1: VFSM in the Virtual Environment

The virtual environment characterises the runtime environment in which a virtual machine operates. It is defined by three sets of names:

• input names represent the control properties of all available variables
• output names represent the available actions on the variables
• state names, as defined for each of the states of the FSM.

The input names build virtual conditions to perform state transitions or input actions. The virtual conditions are built using the positive logic algebra. The output names trigger actions; entry actions, exit actions, input actions or transition actions.

The rules to build a virtual condition are as follows:

VI = {always}
VI = {always, A1}
VI = {always, A1, B2, C4}

Figure 2: VFSM Executor Flow Chart

A subset of all defined input names, which can exist only in a certain situation, is called virtual input or VI. For instance temperature can be either "too low", "good" or "too high". Although there are three input names defined, only one of them can exist in a real situation. This one builds the VI.

A subset of all defined output names, which can exist only in a certain situation is called virtual output or VO. This is built by the current action(s) of the VFSM.

The behaviour specification is built by a state table which describes all details of all states of the VFSM.

The VFSM executor is triggered by VI and the current state of the VFSM. In consideration of the behaviour specification of the current state, the VO is set.

Figure 2 shows one possible implementation of a VFSM executor. Based on this implementation a typical behaviour characteristics must be considered.

A state table defines all details of the behaviour of a state of a VFSM. It consists of three columns; the first column names the state, the second lists virtual conditions built out of input names using the positive logic algebra, and the third column contains the output names:

Read the table as following: the first two lines define the entry and exit actions of the current state. The following lines which do not provide the next state represent the input actions. Finally the lines providing the next state represent the state transition conditions and transition actions. All fields are optional. A pure combinatorial VFSM is possible in cases only where input actions are used, but no state transitions are defined. The transition action can be replaced by the proper use of other actions.

• StateWORKS: an implementation of the VFSM concept
• PlayMaker: implements the VFSM concept as a method of "visual scripting" the Unity game engine

• Wagner, F., "Modeling Software with Finite State Machines: A Practical Approach", Rosa Fischer-Löw Verlag 1994, ISBN 3-929465-04-3
• Wagner, F., "The Virtual Finite State Machines: Executable Control Flow Specification", Auerbach Publications, 2006, ISBN 0-8493-8086-3
• VFSM Executable Specification, CompEuro 1992 Proceedings
• State machine misunderstandings, IEE journal "Computing and Control Engineering", 1997
• A Modern Real-Time Software Design Tool: Applying Lessons from Leo, IEE journal "Computing and Control Engineering", 2003
• Modelling and Building Reliable, Re-usable Software., Engineering of Computer -Based Software 2003 (ECBS'03) Proceedings
• Closing the Gap Between Software Modelling and Code, Engineering of Computer -Based Software 2004 (ECBS'04) Proceedings
• , Wagner, T., "VFSMML - XML standard for VFSM", 2004
• , "The virtual finite‐state machine design and implementation paradigm", Bell Labs Technical Journal / Volume 2, Issue1, 2002