JPH11102205A - Generation of data for control - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable to cope with parallelism, simultaneousness, state hierarchy, interruption events, device drivers, and state-driven program structure by making necessary a mechanism which accepts the generation of all events in all states and transmits the generation of the events or polling the generation of a specific event in a specific state by a program. SOLUTION: Data of control over the device are generated by applying a state transition table having events of the devices in one of the rows and columns and stage of the device in the other. Here, a system (event-driven type) which requires the mechanism (normally a synchronous communication mechanism for RTOS) which accepts the generation of all events in all states and transmits the generation of the events or a system (state-driven type) which polls the generation of a specific event in a specific state by a program is adopted. Consequently, program codes can be loaded from the state transition table to even a system which can not use a timer, etc., by using Cyclic Executive.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a control data forming method for forming data such as control of a device by applying a state transition table which takes an event to one of a row and a column and a state to the other.

[0002]

2. Description of the Related Art There are increasing cases where a state transition table (STM: state transition matrix) is applied to the design of software incorporating a microcomputer. This is because the state transition table is effective in preventing leaks and omissions in the design of the finite state machine. In other words, the contents of control related to the control of complicated machines and devices can be represented by diagrams, but it is difficult to design complete software without errors and errors based on the diagrams. For example, the elements of a machine can be simply and schematically drawn, and the operation can be drawn on a diagram such as drawing a symbol such as an arrow or a simple character.However, each event, each state, and the corresponding content It is very difficult to express the relationship between the process and the transition destination in an easily understandable manner. Therefore, leakage and dropping easily occur.

[0003] On the other hand, a state transition table takes an event that is an external stimulus in one of a row and a column, takes the state of a device or the like in the other, and matches the event with the state (intersection of matrix). ) The processed content and the transition destination are written in the content. In such a table, by writing all possible events in one of the rows and columns and writing all the possible states in the other, it is urged to consider and consider the necessary processing and transition destination for all content. Therefore, leakage and dropping are less likely to occur.

[0004] There are four types of events: variables, interrupts, emails, and function calls. Then, the processing and transition destination are indicated by the cell that matches the event and state.

[0005]

However, the conventional state transition table STM cannot cope with parallelism, state hierarchies, interrupt events, device drivers, and state-driven program structures.

SUMMARY OF THE INVENTION The present invention has been made to solve such a problem. In a data forming method for forming data for controlling a device by applying a state transition table, a parallelism and a simultaneity are provided. It is an object of the present invention to be able to cope with state hierarchies, interrupt events, device drivers, and state-driven program structures.

[0007]

According to a first aspect of the present invention, there is provided a control data forming method which receives an event, receives an occurrence of all events in all states, and requires or specifies a mechanism for transmitting the occurrence of the event. In this state, the occurrence of a specific event is polled by a program.

According to the control data forming method of the present invention, the state transition table defines an object of the tree.

According to a third aspect of the present invention, there is provided a control data forming method, wherein an attribute of exclusive or parallel is indicated for a state of a state transition table.

According to a fourth aspect of the present invention, there is provided a control data forming method, wherein an occurrence method is defined for an event in a state transition table.

According to a fifth aspect of the present invention, in the control data forming method, the state transition table can specify a parent state as a transition destination, and can define an operation of a child state transition in that case. It is characterized by.

The control data forming method according to claim 6 is characterized in that the number of management targets managed by one state transition table can be plural, and the number can be defined.

According to a seventh aspect of the present invention, there is provided a control data forming method, wherein a periodic process performed at the timing of occurrence of an event and state transition is defined.

The control data forming method according to the present invention is characterized in that it is possible to define the components of the software described in the state transition table when the software is installed in the environment.

[0015]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described below in detail with reference to embodiments.

The first embodiment is of a driving type. The drive type is a control data formation method that forms data such as device control by applying a state transition table that takes an event to one of rows and columns and a state to the other. Either a mechanism for accepting the occurrence of all events and transmitting the occurrence of events is required, or the occurrence of a specific event is polled by a program in a specific state.

In other words, the driving type is a so-called state transition table STM.
This defines how to drive the software designed as a program. Originally, the conventional state transition table STM is generally applied to an event-driven program structure.

In this embodiment, a system which accepts the occurrence of all events in all states and requires a mechanism for transmitting the occurrence of events (usually an RTOS synchronization / communication mechanism) is called an event-driven type (E type). I do. On the other hand, the polling (sense) of the occurrence of a specific event in a specific state by a program
The method of performing this is a state-driven type (S type).

This makes it possible to implement a program code from the state transition table STM using Cyclic Executable for a system in which a timer or the like cannot be used. Driving influences the inheritance of events in hierarchy. The event in the E type is always accepted by the root (top parent: level 0), and the child inherits the event. For this reason, the driving type of the state transition table STM in which the events are hierarchized is the E type. The event in the S type is obtained by the active state in units of state. The layering of states cannot limit the inherited events. For this reason, the driving type of the state transition table STM in the state hierarchy is the S type. There is no difference in the notation method of E type and S type STM.

In the second embodiment of the present invention, the state transition table ST
M is a hierarchical type. The hierarchical type is a state transition table ST
This defines the target of the M-tree. Hierarchy for events refers to how to inherit the event received at the root to the child state transition table STM. A in FIG.
Is the notation of the state transition table STM with the event type hierarchy,
Then, C in FIG. 1 is a notation method of state hierarchy. FIG. 1B
Is a frame state, which is a group state that does not receive an event. C in FIG. 1 is called an actual state, and is a group state for receiving an event.

In the third embodiment of the present invention, the state transition table ST
M is of the state type. The state type allows the attribute of the state (exclusive / parallel) to be defined.

That is, the state of the conventional state transition table STM is
One active state per STM. This is called an exclusive state.

A state in which one STM has a plurality of active states is called a parallel state. The notation of the parallel state is shown in FIG. Since the parallel state is always active in parallel, the siblings in the parallel state must be parallel. The transition destination to the parallel state cannot be specified. If you do not want to make sure that the parallel state is always active,
READY / ACTI like task state management of TOS
VE / SUSPEND / DEAD is prepared so that the state can be switched. It is possible to mix exclusive and parallel types in the parent-child relationship in the parallel state.

In the fourth embodiment of the present invention, the state transition table ST
M is of the event type. The event type defines how an event occurs, and there are currently four types. The first is a polling type (P type) in which a program polls for events. The second one is
Synchronous (C type), an event is acquired using the event flag of the RTOS. The third type is a communication type (M type),
The event is acquired using the message of the RTOS. 4th
Is an interrupt type (I type), and an event is acquired by an interrupt handler. The difference between the P-type event of the E-type drive and the S-type drive lies in the inheritance of the event.

In the fifth embodiment of the present invention, the state transition table ST
M is a transition type. The transition type defines the behavior of the child state transition when the parent state is specified as the transition destination. The transition type includes a default type (D type), a history type (H type), and a deep history type. (P type).

Conventionally, there is no parent-child relationship between states.
The transition was always made by specifying one terminal child state. With the introduction of state type and activity type, transition type can be used even in exclusive type state. These types are used for both local transitions that cause transitions within the own STM and global transitions that cause transitions within the other STM. In the sixth embodiment of the present invention, the state transition table STM is of a plane type. A plain type is a state transition table ST
The number of objects managed by M is defined. In the conventional STM, one STM manages one system in principle. By introducing the plane type, a plurality of system targets can be managed by one STM. Used when managing multiple ports with the same protocol.

In the seventh embodiment of the present invention, the state transition table ST
M is of the activity type. The activity type defines a periodic process performed at the timing of event occurrence and state transition. The introduction in the activity type can reduce the description in the action cell. The activity types include a state activity (SA), an event activity (EA), a dispatch activity (DA), and a trigger activity (TA). There are three types of SA: start, mode, and end.

The state start activity (SSA) is executed when a transition is made to the state, and the state end activity (SEA) is executed when the state departs from the state. State mode activity (SM
A) is executed while in this state. DA (dispatch activity) is activated every time the state scheduler operates. SMA (state mode activity) and DA (dispatch activity) cannot be used in E-type driving. The EA (event activity) includes an event analysis start activity, an event analysis end activity, an event detection start activity, and an event detection end activity.
There is one. TA (trigger activity) is route ST
It is executed only when M is started for the first time.

In the eighth embodiment of the present invention, the state transition table ST
M is a belonging type, and defines a component in a software implementation environment described in STM. The affiliation types include a task type, a module type, a subroutine type, a library type, and a device drive type. In the case of the library type and the device drive type, a function declaration is described in the event column as shown in FIG.

[0030]

According to the present invention, in a data forming method for forming data for control of an apparatus by applying a state transition table, parallelism, concurrency, state hierarchy, interrupt event, device driver And a state-driven program structure.

[Brief description of the drawings]

FIG. 1 is a diagram showing an example of a state transition table for explaining an embodiment of the present invention.

Claims (8)

[Claims] 1. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other of the device. A data forming method which requires a mechanism for receiving all occurrences of an event in a state and transmitting the occurrence of an event, or polling the occurrence of a specific event by a program in a specific state 2. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, and wherein the state transition table is A method for forming control data, wherein an object of a tree is defined. 3. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, A method for forming control data, characterized in that an attribute indicating whether the state is exclusive or parallel is indicated. 4. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, A method for forming control data, wherein an occurrence method is defined for an event. 5. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, wherein the state transition table comprises: A method for forming control data, wherein a parent state can be designated as a transition destination, and an operation of a child state transition in that case can be defined. 6. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, comprising: Can manage multiple managed objects,
A control data forming method characterized in that the number can be defined. 7. A control data forming method for forming data such as control of a device by applying a state transition table which takes an event of a device to one of a row and a column and a state to the other, comprising: Control data forming method, wherein a periodic process to be performed at a predetermined timing is defined. 8. A control data forming method for forming data such as control of a device by applying a state transition table that takes an event of a device to one of a row and a column and a state to the other, A method for forming control data, characterized in that components of the described software in an implementation environment can be defined.