Synchronous formal language for programming deterministic finite state machines

A program comprising:

• 1) a routine adapted to describe the behaviour of a finite state machine in a synchronous formal language for programming deterministic finite state machines controlling a physical process, said language including a graphical representation, wherein the behaviour of a finite state machine is represented as a graph of steps and transitions, wherein actions are associated with steps;
• and wherein a transition between two steps includes:
• a) at least a pause flag, controlling the cycle during which a condition associated with the transition is evaluated, wherein the pause flag comprises:
• a.1) an activation flag, wherein:
• for one value of the activation flag, the step following the transition is activated as soon as a condition associated with the transition is true;
• and
• for the other value of the activation flag, at least one cycle is performed in the step preceding the transition;
• and
• a.2) a delay flag wherein:
• for one value of the delay flag, the step following the transition is activated in the same cycle as the one during which the transition is activated;
• and
• for the other value of the delay flag, the step following the transition is activated in the cycle following the one during which the transition is activated;
• and
• b) a pre-emption flag, according to which the condition associated with the transition is evaluated before or after an action associated with the step preceding the transition is executed;
• and wherein the values of the flags being graphically represented in the graphical representation such that:
• said one value of the activation flag is represented by a continuous line from the step preceding the transition to the transition;
• said other value of the activation flag is represented by an interrupted line from the step preceding the transition to the transition;
• said one value of the delay flag is represented by a continuous line from the transition to the step following the transition;
• said other value of the delay flag is represented by an interrupted line from the transition to the step following the transition;
• and
• the value of the pre-emption flag is represented as a shape of the transition;
• wherein a transition following a set of parallel branches further includes a join flag and wherein a transition with an active join flag is only evaluated when said parallel branches have all reached a step preceding said transition;
• and
• 2) a graphical user interface adapted to display a description of the behaviour of a finite state machine in said language.