WO2018230298A1 - Partially ordered procedure generation device, partially ordered procedure generation method, and partially ordered procedure generation program - Google Patents

Abstract

A partially ordered procedure generation device 10 is provided with: an addition unit 11 for adding steps constituting a sequential procedure in which steps for changing a system configuration are arranged in series to a graph that represents a partially ordered procedure in which steps are arranged in a partially ordered structure in which, between some of the steps, no order relation is given; and a determination unit 12 for determining that an order relation exists in a set, among sets of the added steps and the steps constituting the partially ordered procedure, that satisfies a prescribed condition.

Description

Semi-order procedure generating apparatus, semi-order procedure generating method, and semi-order procedure generating program

The present invention relates to a partial order procedure generation device, a partial order procedure generation method, and a partial order procedure generation program. In particular, the sequential procedure can be converted into a partial order without misjudging the order relation, and is used for a system configuration change. The present invention relates to an order procedure generation apparatus, a partial order procedure generation method, and a partial order procedure generation program.

In general, when building or changing a system, the system administrator creates a procedure manual for building or changing the components that make up the system as required, and the construction worker or modification worker is created. This is realized by executing construction work or modification work according to the procedure manual.

In order for construction work or modification work to be completed correctly, construction work or modification work must be executed in the correct order. The order of construction work or change work varies depending on the characteristics of parts constituting the system (hereinafter referred to as system constituent parts or simply parts) and combinations of parts.

In other words, in order to correctly describe the contents of the procedure manual, the administrator is required to have a deep understanding of the work target system and the parts of the work target system. The preparation of the procedure manual requires a high level of expertise and a lot of time.

Provided a technology that formally expresses the requirements related to the procedure for building or changing a part used to create a procedure document as described above, and automatically generates the build procedure or change procedure based on the expressed requirement Has been.

For example, Non-Patent Document 1 describes a state after the system is constructed and a state after the system is constructed based on information in which the state after the modification is declaratively described as a model. A technique for calculating a difference between a state or a state after being changed and automatically calculating a construction procedure or a change procedure is described.

In the above technical field, a system for calculating a construction procedure or a change procedure includes, for example, a state model conversion unit, a route search unit, and a transition order conversion unit. The system construction procedure generation system configured as described above generates procedures in the order of state model conversion, route search, and partial order procedure. Note that “semi-order proceduralization” corresponds to “transition order conversion” in Patent Document 1.

Before explaining the processing contents of state model conversion, route search, and partial order proceduralization, one system described in Patent Document 1 and Non-Patent Document 1 declaratively describes the state of the system as a model. A state model will be described.

The state model is a data model that represents information required for calculating the system change procedure. The state model is composed of state elements and dependencies between the state elements.

The state element represents a component in the system configuration that has a state independent of other elements. That is, the state element is the smallest unit considered when the procedure is calculated. A state element is defined by a plurality of exclusive states and state transitions between states.

The state is a state that the part can take. States are defined in the state elements as much as the part can take. The state element necessarily includes one current state and an arbitrary number of request states.

Also, the state transition represents a state in which a component in an arbitrary state can transition. A state transition is defined between arbitrary states of one state element.

Next, the dependency is defined from the state transition of the state element (hereinafter referred to as the dependency state element) to the state of the other state element (hereinafter referred to as the dependency state element). The defined dependency represents a condition that, in order for the state element of the dependency source to perform the state transition accompanied by the dependency, the state element of the dependency destination must be in the state accompanied by the dependency.

As described above, the state element corresponds to the part in the system configuration. That is, the state transition performed by the state element corresponds to a single process performed on the corresponding component in the entire procedure of system construction or system change.

FIG. 11 is an explanatory diagram showing an example of a state model. The state model shown in FIG. 11 is a specific example of the state model in Patent Document 1. In the state model shown in FIG. 11, the Tomcat package and Ubuntu VM (Virtual Machine) are defined. In Patent Document 1, “state model” is described as “state machine group”, and “state element” is described as “state machine”.

The rectangle shown in FIG. 11 represents the state element. An ellipse in the rectangle represents the state. A double line ellipse represents the current state. Moreover, a black ellipse represents a request state. Also, solid arrows between ellipses represent state transitions. Further, a dashed arrow between rectangles represents dependency.

In the example shown in FIG. 11, the current state of each state element is defined as state f, and the requested state of each state element is defined as state t. The state f represents a state where it is not installed. The state t represents an installed state.

In the example shown in FIG. 11, the dependency is displayed as a dashed arrow from the state element to the state. That is, the dependency shown in FIG. 11 represents that all state transitions of the state element at the base of the arrow depend on the state indicated by the tip of the arrow.

Also, on each state element, the state element type and the state element ID are described. For example, FIG. 11 describes a state element Tomcat whose type is Package and a state element Ubuntu whose type is VM.

Hereinafter, in the present specification, when the state element A includes a state transition depending on the state of the state element B, “the state element A depends on the state element B” or “the state element A depends on the state element B”. It is expressed as “having sex”.

Hereafter, each processing content of state model conversion, route search, and partial order procedure will be explained. First, processing contents of state model conversion will be described. The state model conversion is a process of converting a plurality of state elements included in the state model into a single state transition system by combining them.

Each state of the state transition system after conversion corresponds to various combinations of each state of all state elements included in the state model before conversion. Each state transition in the state transition system after the conversion corresponds to each state transition of all the state elements included in the state model before the conversion. In Patent Document 1, “state model conversion” is described as “state machine group conversion”.

Next, the processing contents of the route search will be described. The route search is a process for obtaining a transition order for transitioning the state from the current state to the requested state in the state transition system obtained by the state model conversion. In order to obtain the transition order, for example, a generally well-known graph route search method is used. Specific examples of the graph route search method include Dijkstra method and AutomatedAutoPlanning (automatic planning).

The state transition sequence constituting the route obtained by the route search represents a sequential procedure for constructing or changing the system. Each state transition in the state transition sequence corresponds to each step constituting a sequential procedure.

Next, the processing contents of the partial order procedure will be described. The partial order proceduralization is a process of converting a state transition sequence constituting a route obtained by route search into a partial order set of state transitions in which an order relation is given only between state transitions ordered by dependency.

The semi-ordered set is an ordered set in which there is a set of elements to which no order relation is assigned. Further, the total ordered set is an ordered set in which an order relation is given to all pairs of elements.

The route obtained by the route search is composed of a state transition sequence representing a sequential procedure in which the order is determined from the first state transition to the last state transition, and thus is represented as a total ordered set. However, the state transition sequence constituting the path includes a set of state transitions to which an order relation not caused by the dependency is given. The partial order procedural process is a process of eliminating the order relation given to the set of state transitions as described above and converting the state transition sequence into a partial order set.

The order relation given to the set of state transitions corresponds to the order relation between the steps constituting the procedure for constructing or changing the system. That is, the partial order procedure is a partial order set procedure in which an order relation is given only to a set of state transitions ordered by dependency.

Processes corresponding to a set of state transitions to which no order relationship is assigned are processes that can be executed in an arbitrary order. That is, each process may be performed in parallel.

In this specification, a state transition that is executed first in a set of state transitions or a set of steps to which an order relationship is given is referred to as “a state transition that is dependent (from a state transition that is executed later)” and is executed later. Each state transition is expressed as “a state transition depending on (a state transition executed first)”.

In addition, even when a specific set of state transitions is not focused, the state transition executed before the predetermined state transition is referred to as “dependent state transition”, and the state transition executed after the predetermined state transition. Are expressed as “dependent state transitions”.

As described above, the technique described in Non-Patent Document 1 is based on the state model conversion and path using the current state of the system and the state model in which the state after being constructed or the state after being changed is defined as an input. Perform search and partial ordering. By performing each process, the technique described in Non-Patent Document 1 can derive a partial order procedure for constructing or changing a system.

JP2015-215585A

The first problem of the change planning system described in Patent Document 1 is that there is a possibility of erroneous determination that a set of state transitions having no order relationship has an order relationship. The reason is that there is a problem in the method for determining whether or not there is an order relationship between the state transitions in the derivation of the partial order procedure.

Specific examples in which the change planning system described in Patent Document 1 erroneously determines whether there is an order relationship between state transitions are shown in FIGS. FIG. 12 is an explanatory diagram illustrating another example of the state model. The meaning of each notation of the state model shown in FIG. 12 is the same as the meaning of each notation corresponding to the state model shown in FIG.

However, the ID of the state element shown in FIG. 12 is described in a rectangle located on the rectangle representing the state element. In the state model shown in FIG. 12, a white circle is described at the base of a broken-line arrow representing dependency. A white circle is a symbol representing the state transition of the dependency source.

FIG. 13 is an explanatory diagram showing an example of a sequential procedure. The procedure shown in FIG. 13 is, for example, a sequential system construction procedure or a system change procedure. A rounded rectangle shown in FIG. 13 represents a state transition.

Consider a case where the sequential construction procedure or change procedure shown in FIG. 13 performed on the system represented by the state model shown in FIG. In the state model shown in FIG. 12, when the state element B executes a state transition from the state t to the state f, there is a dependency that requires the state of the state element A to be the state f.

FIG. 13 also describes a procedure in which the state element B executes the state transition from the state f to the state t after the state element A executes the state transition from the state f to the state t. In the partial ordering of the procedure, it is determined whether or not there is an order relationship between the state transition of state element A from state f to state t and the state transition of state element B from state f to state t. Is required.

The above-described dependency in the state model shown in FIG. 12 does not order the two state transitions shown in FIG. That is, there is no order relationship between the state transition pairs shown in FIG. However, the change planning system described in Patent Document 1 erroneously determines that there is an order relationship among the state transition pairs shown in FIG.

The reason is that if there is a dependency between a state element that performs one state transition and a state element that performs the other state transition included in the set of state transitions, the change planning system described in Patent Document 1 This is because it is determined that there is an order relationship between the pair of state transitions without considering the contents of the dependency.

As described above, the change planning system described in Patent Document 1 has a problem in the method for determining whether or not there is an order relationship between state transitions. It may be judged.

The second problem of the change planning system described in Patent Document 1 is that it takes time to derive the partial order procedure because it is not efficient. In the derivation process of the partial order procedure, the change planning system described in Patent Document 1 manages the partial order procedure with a graph-type data structure (hereinafter referred to as a partial order procedure graph).

Each time a state transition in a state transition sequence representing a sequential procedure is added to the partial order procedure graph, the change planning system described in Patent Document 1 searches the partial order procedure graph. It takes time.

[Object of invention]
Therefore, an object of the present invention is to provide a partial order procedure generation apparatus, a partial order procedure generation method, and a partial order procedure generation program capable of correctly determining whether or not there is an order relationship between a set of processes, which solves the above-described problem. .

The partial order procedure generation apparatus according to the present invention has a structure in which an order relationship is not given between some steps of steps constituting a sequential procedure in which steps for changing a system configuration are arranged in series. An additional part to be added to a graph representing a semi-order procedure, which is a procedure in which processes are arranged in a semi-order structure, and an order relationship between a set satisfying a predetermined condition among a set of steps constituting the added process and the semi-order procedure. And a determination unit that determines that there exists.

The partial order procedure generation method according to the present invention has a structure in which an order relationship is not given to a part of steps constituting a sequential procedure in which steps for changing a system configuration are arranged in series. Add to the graph that represents the partial order procedure, which is the order in which the steps are arranged in the partial order structure, and there is an order relation in the set that satisfies the predetermined condition among the pairs of steps that constitute the added step and the partial order procedure. It is characterized by determining.

The partial order procedure generation program according to the present invention does not give a sequential relationship between some steps to a computer that constitutes a sequential procedure in which steps for changing the system configuration are arranged in series. A set that satisfies a predetermined condition among a set of additional processes to be added to a graph representing a partial order procedure that is a procedure in which steps are arranged in a partial order structure that is a structure, and a step that constitutes the added step and the partial order procedure It is characterized in that a determination process for determining that there is an order relationship is executed.

According to the present invention, it is possible to correctly determine the presence / absence of an order relationship between process groups.

It is a block diagram which shows the structural example of 1st Embodiment of the partial order procedure production | generation apparatus by this invention. It is a flowchart which shows the whole operation | movement of the partial order procedure graph output process by the partial order procedure production | generation apparatus 100 of 1st Embodiment. It is a flowchart which shows the operation | movement of the partial order procedure graph addition process by the partial order procedure addition part 120 of 1st Embodiment. It is a block diagram which shows the structural example of 2nd Embodiment of the partial order procedure production | generation apparatus by this invention. It is a flowchart which shows the whole operation | movement of the partial order procedure graph output process by the partial order procedure production | generation apparatus 200 of 2nd Embodiment. It is a flowchart which shows the operation | movement of the partial order procedure graph initialization process by the partial order procedure graph management part 230 of 2nd Embodiment. It is a flowchart which shows the operation | movement of the partial order procedure graph addition process by the partial order procedure addition part 220 of 2nd Embodiment. It is a flowchart which shows the operation | movement of the semi-order procedure graph post-process by the semi-order procedure graph management part 230 of 2nd Embodiment. It is explanatory drawing which shows the hardware structural example of the partial order procedure production | generation apparatus by this invention. It is a block diagram which shows the outline | summary of the partial order procedure production | generation apparatus by this invention. It is explanatory drawing which shows the example of a state model. It is explanatory drawing which shows the other example of a state model. It is explanatory drawing which shows the example of a sequential procedure.

Embodiments of the present invention will be described below with reference to the drawings. In the embodiment of the present invention, the order relationship between state transitions is classified into the following three types.
-Order relationship by being dependent-Order relationship by being dependent-Order relationship between state transitions of the same state element

The “order relationship due to dependency” is an order relationship that is established because the execution condition of the state transition to be executed later is satisfied by executing the state transition first. For example, in the state model shown in FIG. 12, the state transition executed first is the state transition from state t to state f of state element A, and the state transition executed later is from state t to state f of state element B. In the case of a state transition, the above order relationship is established.

The reason why the above order relation holds is that, since the state transition of the state element B depends on the state f of the state element A, the state transition of the state element B is executed unless the state transition of the state element A is executed first. This is because the condition is not satisfied and the state transition of the state element B remains unexecutable.

In order to determine whether or not the above-described order relationship is satisfied, it is only necessary to determine whether or not a state transition executed later depends on a transition destination state of a state transition executed first. . When the state transition executed later depends on the state of the transition destination of the state transition executed first, the above-described order relation is established.

The “order relationship due to being dependent” is an order relationship that is established when the state transition is executed first and the execution condition of the state transition executed later is not satisfied. For example, in the state model shown in FIG. 12, the state transition executed first is the state transition from state t to state f of state element B, and the state transition executed later is from state f of state element A to state t. In the case of a state transition, the above order relationship is established.

The reason why the above order relation holds is that, since the state f of the state element A depends on the state transition of the state element B, if the state transition of the state element A is executed first, the state transition of the state element B This is because the state transition condition of the state element B becomes impossible to execute.

In order to determine whether or not the above-described order relationship is satisfied, it is only necessary to determine whether or not the state transition executed first depends on the state of the transition source of the state transition executed later. . When the state transition executed first depends on the state of the transition source of the state transition executed later, the above order relation is established.

“The order relationship between the state transitions of the same state element” is an order relationship that is established because the state transition executed first and the state transition executed later are the state transitions of the same state element. For example, in the state model shown in FIG. 12, the state transition executed first is the state transition from state t to state f of state element A, and the state transition executed later is from state f of state element A to state t. In the case of a state transition, the above order relationship is established.

The reason why the above-described order relationship is established is that the state element A can not execute the state transition from the state f until after the state transition to the state f is executed. In order to determine whether or not the above-described order relationship holds, it is determined whether or not the state element that performs the state transition executed first is the same as the state element that performs the state transition executed later. Just do it. When the two state elements are the same, the above-described order relationship is established.

When determining whether or not there is an order relationship of a set of state transitions, if there is a dependency between each state element that performs each state transition of the set of state transitions as in the change planning system described in Patent Document 1 If it is determined that there is an order relationship, it is erroneously determined that there is an order relationship in a set of state transitions that do not have an order relationship.

Determining whether or not the dependency between each state element that performs each state transition of the state transition set is an order relationship by being dependent, or a dependency that establishes an order relationship by being dependent If this is done, it is avoided that a group of state transitions having no order relationship is erroneously determined to have an order relationship.

Utilizing the above characteristics, the present invention provides a system that does not erroneously determine the presence / absence of an order relationship of a set of state transitions in the process of deriving a partial order procedure for system configuration change. In addition, the present invention provides a system that can derive a partial order procedure for changing the system configuration without searching for a partial order procedure managed by a graph type data structure.

[First Embodiment]
[Description of configuration]
Next, a first embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a configuration example of a first embodiment of a partial order procedure generation device according to the present invention. The partial order procedure generation apparatus 100 of this embodiment is an apparatus used when the system configuration is changed.

As shown in FIG. 1, the partial order procedure generation device 100 of this embodiment includes a sequential procedure processing unit 110, a partial order procedure adding unit 120, and a partial order procedure graph management unit 130. Each component operates as follows.

The sequential procedure processing unit 110 is based on a sequential procedure in which system construction steps or system change steps are arranged in series, and a semi-order procedure in which system construction steps or system change steps are arranged in a semi-ordered structure. It has the function to generate.

Specifically, the sequential procedure processing unit 110 extracts processes in order from the beginning of the sequential procedure, and inputs the extracted processes to the semi-sequenced procedure adding unit 120.

The partial order procedure adding unit 120 has a function of adding a system construction process or a system change process input from the sequential procedure processing unit 110 to the partial order procedure graph.

When adding a process to a partial order procedure graph, the partial order procedure addition unit 120 searches the partial order procedure graph held by the partial order procedure graph management unit 130, and determines each step based on the type of the set of processes having an order relationship. It is determined whether or not a set of processes has an order relationship.

The semi-ordered procedure graph management unit 130 has a function of holding a semi-ordered procedure graph. In the partial order procedure graph of this embodiment, a process corresponds to a node of the graph. Further, when there is an order relationship between processes, a directed edge is drawn from a node of a dependent process toward a node of the dependent process.

Further, as shown in FIG. 1, the partial order procedure generation device 100 may be connected to an input device, an output device, and a storage device so as to be able to communicate with each other.

[Description of operation]
Hereinafter, the operation of outputting the partial order procedure graph of the partial order procedure generation device 100 of the present embodiment will be described with reference to FIG. FIG. 2 is a flowchart illustrating an overall operation of the partial order procedure graph output process by the partial order procedure generation device 100 according to the first embodiment.

When the system configuration is changed, the partial order procedure generation apparatus 100 first has a state model M11 representing a system to be built or changed as an input to the entire apparatus and a system construction process or a system change process in series. The arranged sequential procedures SP11 are received (step S110).

Next, the sequential procedure processing unit 110 checks whether or not a process remains in the received sequential procedure SP11 (step S120). When the process remains (Yes in step S120), the sequential procedure processing unit 110 takes out the first process remaining in the sequential procedure SP11 (step S130).

Next, the partial order procedure adding unit 120 refers to the received state model M11, and adds the process extracted in step S130 to the partial order procedure graph G11 held by the partial order procedure graph management unit 130. A graph addition process is executed (step S140). Note that nothing is included in the partial order procedure graph G11 in the initial state.

The semi-sequence procedure generation device 100 repeatedly executes the processing from step S130 to step S140 until no process remains in the sequential procedure SP11. When no process remains in the sequential procedure SP11 (No in step S120), the sequential procedure processing unit 110 outputs a semi-ordered procedure graph G11 at a stage where all the processes of the sequential procedure SP11 are processed (step S150). After outputting the partial order procedure graph, the partial order procedure generation apparatus 100 ends the partial order procedure graph output process.

Next, the semi-order procedure graph addition process in step S140 shown in FIG. 2, which is a sub-process constituting the half-order procedure graph output process, will be described with reference to FIG. FIG. 3 is a flowchart illustrating the operation of the partial order procedure graph addition process by the partial order procedure addition unit 120 according to the first embodiment.

First, the partial order procedure adding unit 120 acquires all the steps that are not dependent on any other steps among the steps included in the partial order procedure graph G11 (step S141).

Next, the partial order procedure adding unit 120 adds the process extracted in step S130 as a node to the partial order procedure graph G11G (step S142). Next, the partial order procedure adding unit 120 checks whether there is a process that has not yet been selected among the processes acquired in Step S141 (Step S143).

If there is a process that has not yet been selected (Yes in step S143), the partial order procedure adding unit 120 selects one arbitrary process that has not yet been selected from the processes acquired in step S141 (step S144). ).

Next, the partial order procedure adding unit 120 acquires one step at a time that can be traced by the depth-first search from the step selected in step S144 on the partial order procedure graph G11. A depth-first search is a search that follows the direction of a directed edge, i.e., follows a dependent process from a dependent process.

The partial order procedure adding unit 120 confirms whether or not all the processes that can be followed by the depth-first search have been acquired (step S145). If there is a process that has not yet been acquired (No in step S145), the partial order procedure adding unit 120 can be traced by a depth-first search from the process selected in step S144 and has not yet been acquired. Is acquired (step S146).

Next, the partial order procedure adding unit 120 determines whether or not there is an order relationship between the process acquired in step S146 and the process extracted in step S130 with reference to the state model M11 (step S147). ).

Specifically, the partial order procedure adding unit 120 performs, from the state model M11, a state element that executes a state transition corresponding to the process acquired in step S146 and a state transition corresponding to the process extracted in step S130. Get the state element to execute.

Next, the partial order procedure adding unit 120 determines whether or not “order relationship due to dependence”, “order relationship due to dependence”, or “same” between the two steps based on the acquired state element. It is determined whether or not any of the “order relationship between state transitions of state elements” is satisfied.

If any order relationship does not hold, the partial order procedure adding unit 120 determines that there is no order relationship between the processes (No in step S147). Next, the partial order procedure adding unit 120 performs the process of step S145 again.

If any order relationship is established, the partial order procedure adding unit 120 determines that there is an order relationship between the processes (Yes in step S147). Next, the partial order procedure adding unit 120 assigns a directed edge toward the process acquired in Step S146 from the process added in Step S142 (the process extracted in Step S130) to the partial order procedure graph G11 ( Step S148). After providing the directed edge, the partial order procedure adding unit 120 performs the process of step S145 again.

Note that if any of the order relationships holds, the partial order procedure adding unit 120 does not perform a depth-first search beyond the process acquired in step S146. Further, in order not to search for the same process more than once, the partial order procedure adding unit 120 records the searched process. The partial order procedure adding unit 120 does not search for the searched process and the previous process of the searched process.

Until the depth-first search is completed, that is, until all the processes that can be followed by the depth-first search are acquired, the partial order procedure adding unit 120 repeatedly executes the processing from step S146 to step S148. When all the processes that can be followed by the depth-first search are acquired (Yes in step S145), the partial order procedure adding unit 120 performs the process of step S143 again.

The partial order procedure adding unit 120 repeatedly executes the processes of steps S144 to S148 until all the processes acquired in step S141 are selected. When all the processes acquired in step S141 are selected (No in step S143), the partial order procedure adding unit 120 ends the partial order procedure graph addition process.

[Description of effects]
Hereinafter, the effect of this embodiment will be described. Since the partial order procedure adding unit 120 according to the present embodiment determines the presence / absence of the order relation of each process set based on the type of the process set having the order relation, the presence / absence of the order relation is correctly determined. Therefore, the partial order procedure production | generation apparatus 100 of this embodiment can avoid the problem that the change plan system described in patent document 1 misjudged the presence or absence of the order relationship of the group of processes.

The semi-sequence procedure generation device 100 according to the present embodiment can solve the above-described first problem that is erroneously determined that there is an order relationship in a set of transitions having no order relationship. When the partial order procedure generation apparatus 100 of the present embodiment is used for system configuration change, the change planning system described in Patent Document 1 cannot correctly half-order the sequential procedure of system construction or system change. Even in this case, the sequential procedure is correctly semi-ordered.

[Second Embodiment]
[Description of configuration]
Next, a second embodiment of the present invention will be described with reference to the drawings. FIG. 4 is a block diagram showing a configuration example of the second embodiment of the partial order procedure generation device according to the present invention. The partial order procedure generation apparatus 200 of this embodiment is an apparatus used when the system configuration is changed.

As shown in FIG. 4, the partial order procedure generation apparatus 200 according to the present embodiment includes a sequential procedure processing unit 210, a partial order procedure addition unit 220, and a partial order procedure graph management unit 230. Each component operates as follows.

The sequential procedure processing unit 210 is based on a sequential procedure in which system construction steps or system change steps are arranged in series, and a semi-order procedure in which system construction steps or system change steps are arranged in a semi-ordered structure. It has the function to generate.

Specifically, the sequential procedure processing unit 210 sequentially extracts processes from the beginning of the sequential procedure, and inputs the extracted processes to the semi-sequenced procedure adding unit 220.

The partial order procedure adding unit 220 does not search the partial order procedure graph held by the partial order procedure graph management unit 230, and does not search for the system construction process or the system change process input from the sequential procedure processing unit 210. Has a function to add to the graph.

When adding a process to the semi-order procedure graph, the semi-order procedure addition unit 220 utilizes information on a process that is performed last for each component in the system configuration.

The partial order procedure graph management unit 230 has a function of holding a partial order procedure graph. The partial order procedure graph management unit 230 acquires the process performed first or the process performed last for each component in the system configuration in accordance with the command input from the partial order procedure addition unit 220. Next, the partial order procedure graph management unit 230 passes the acquired steps to the partial order procedure addition unit 220.

In the semi-ordered procedure graph of this embodiment, processes correspond to the nodes of the graph. When there is an order relationship between processes, a labeled directed edge is drawn from a dependent process node toward a dependent process node.

The label attached to the directed edge indicates that the order relationship between processes is “order relationship due to dependency”, “order relationship due to dependency”, or “order relationship between state transitions of the same state element”. Which of the following is true.

Further, as shown in FIG. 4, the partial order procedure generation device 200 may be communicably connected to an input device, an output device, and a storage device.

[Description of operation]
Hereinafter, the operation of outputting the partial order procedure graph of the partial order procedure generation device 200 of the present embodiment will be described with reference to FIG. FIG. 5 is a flowchart illustrating the overall operation of the partial order procedure graph output process by the partial order procedure generation device 200 according to the second embodiment.

When the system configuration is changed, the partial order procedure generation apparatus 200 first has a state model M21 representing a system to be built or changed as an input to the entire apparatus and a system construction process or a system change process in series. The arranged sequential procedure SP21 is received (step S210).

Next, the partial order procedure graph management unit 230 performs a partial order procedure graph initialization process for initializing the stored partial order procedure graph G21 with reference to the received state model M21 (step S220).

Next, the sequential procedure processing unit 210 checks whether or not a process remains in the received sequential procedure SP21 (step S230). When the process remains (Yes in step S230), the sequential procedure processing unit 210 takes out the first process remaining in the sequential procedure SP21 (step S240).

Next, the partial order procedure adding unit 220 refers to the received state model M21, and executes a partial order procedure graph addition process for adding the process extracted in step S240 to the partial order procedure graph G21 (step S250). .

The semi-sequence procedure generation device 200 repeatedly executes the processing from step S240 to step S250 until no process remains in the sequential procedure SP21. When no process remains in the sequential procedure SP21 (No in step S230), the partial order procedure graph management unit 230 performs the partial order procedure graph post-processing on the partial order procedure graph G21G (step S260).

Next, the sequential procedure processing unit 210 outputs the semi-ordered procedure graph G21 at the stage where the semi-ordered procedure graph post-processing is executed (step S270). After outputting the partial order procedure graph, the partial order procedure generation device 200 ends the partial order procedure graph output process.

Next, each sub-process constituting the partial order procedure graph output process will be described. First, the semi-order procedure graph initialization process of step S220 shown in FIG. 5 will be described with reference to FIG. FIG. 6 is a flowchart illustrating the operation of the partial order procedure graph initialization process by the partial order procedure graph management unit 230 according to the second embodiment.

半 Nothing is included in the partial sequence graph G21 before the partial sequence graph initialization process is executed. First, the partial order procedure graph management unit 230 checks whether there is a state element that has not yet been selected from the received state model M21M (step S221).

If there is a state element that has not yet been selected (Yes in Step S221), the partial order procedure graph management unit 230 selects one arbitrary state element from among the state elements that are not selected in the state model M21 (Step S221). S222).

Next, the partial order procedure graph management unit 230 adds a dummy process representing the state transition of the selected state element to the current state as a node in the partial order procedure graph G21G (step S223). The added dummy process is a process for correctly executing the partial order procedure graph addition process of step S250.

The semi-order procedure graph management unit 230 does not add the order relationship (directed edge) between the added dummy process and another process to the semi-order procedure graph G21. In addition, the state of the state element before the added process is executed may be any state other than the current state.

For example, the partial order procedure graph management unit 230 may determine the state of the state element as state f if the current state is state t, and state t if the current state is state f. Further, the partial order procedure graph management unit 230 may determine the state of the state element by another method.

The partial order procedure graph management unit 230 repeatedly executes the processing from step S222 to step S223 until there is no state element that has not yet been selected from the state model M21. If there is no unselected state element (No in step S221), the partial order procedure graph management unit 230 ends the partial order procedure graph initialization process.

Next, the semi-order procedure graph addition process of step S250 shown in FIG. 5 will be described with reference to FIG. FIG. 7 is a flowchart illustrating the operation of the partial order procedure graph addition process by the partial order procedure addition unit 220 according to the second embodiment.

First, the partial order procedure adding unit 220 adds the process extracted in step S240 as a node to the partial order graph G21G (step S251).

Next, the partial order procedure adding unit 220 refers to the received state model M21 and lists all the state elements on which the state transition representing the process extracted in Step S240 depends (Step S252).

Next, the partial order procedure adding unit 220 checks whether there is a state element that has not yet been selected among the listed state elements (step S253). If there is a state element that has not yet been selected (Yes in step S253), the partial order procedure adding unit 220 selects one arbitrary state element that has not yet been selected from the listed state elements (step S254). ).

Next, the partial order procedure adding unit 220 acquires from the partial order procedure graph management unit 230 the process that is last performed by the state element selected in step S254 (step S255).

Next, the partial order procedure adding unit 220 determines whether or not the “order relationship due to dependence” is established between the process acquired in step S255 and the process extracted in step S240 (step S256). ).

When the target order relationship holds, the partial order procedure adding unit 220 sets the “order relationship due to dependence” from the process node extracted in step S240 to the process node acquired in step S255. The indicated directed edge with label is drawn (step S257).

The partial order procedure adding unit 220 repeatedly executes the processing from step S254 to step S257 until there is no state element that has not been selected. If there is no state element that has not yet been selected (No in step S253), the partial order procedure adding unit 220 performs the final step performed by the state element that performs the process extracted in step S240. (Step S258).

Note that the process performed last by the state element acquired in step S258 is a process performed by the state element immediately before the process extracted in step S240.

Next, the partial order procedure adding unit 220 corresponds to the node to which the labeled directed edge indicating the “order relation due to dependence” is drawn toward the node of the process acquired in step S258. Are enumerated (step S259).

Next, the partial order procedure adding unit 220 confirms whether or not there is a process that has not yet been selected among the processes listed in Step S259 (Step S25A). When there is a process that has not yet been selected (Yes in step S25A), the partial order procedure adding unit 220 selects one arbitrary process that has not yet been selected from the listed processes (step S25B).

Next, the partial order procedure adding unit 220 adds a labeled directed edge indicating an “order relation due to dependence” from the process node extracted in step S240 to the process node selected in step S25B. Subtract (step S25C).

The semi-order procedure adding unit 220 repeatedly executes the processing from step S25B to step S25C until there is no process that has not been selected. If there is no process that has not yet been selected (No in step S25A), the partial order procedure adding unit 220 is directed with a label indicating "order relation due to dependence" from the process node extracted in step S240. It is confirmed whether or not the edge is drawn (step S25D).

If even one directed edge with a label indicating “order relationship due to dependence” is drawn (Yes in step S25D), the half-order procedure addition unit 220 ends the half-order procedure graph addition processing. .

If no labeled directed edge indicating “order relationship due to dependency” is drawn (No in step S25D), the partial order procedure adding unit 220 determines that “the order between the state transitions of the same state element” A labeled directed edge indicating "relation" is drawn (step S25E).

The partial order procedure adding unit 220 draws a labeled directed edge from the process node extracted in step S240 toward the process node acquired in step S258. After drawing the labeled directed edge, the partial order procedure adding unit 220 ends the partial order procedure graph addition process.

Next, post-processing of the partial order procedure graph in step S260 shown in FIG. 5 will be described with reference to FIG. FIG. 8 is a flowchart illustrating the operation of the semi-sequence procedure graph post-processing by the semi-sequence procedure graph management unit 230 according to the second embodiment.

First, the partial order procedure graph management unit 230 checks whether there is a state element that has not yet been selected among the state elements that perform the steps included in the partial order procedure graph G21G (step S261).

If there is a state element that has not yet been selected (Yes in step S261), the partial order procedure graph management unit 230 selects one arbitrary item that has not yet been selected among the state elements that perform the steps included in the partial order procedure graph G21. Is selected (step S262).

Next, the partial order procedure graph management unit 230 acquires a process (dummy process) that is first performed by the state element selected in step S262 (step S263).

Next, the semi-ordered procedure graph management unit 230 performs a semi-processing of all the order relations (directed edges in the graph) between the process acquired in step S263 and other processes and the acquired process itself (nodes in the graph). It removes from the order procedure graph G21 (step S264). Each process removed in step S264 is a dummy process added in step S220.

The semi-ordered procedure graph management unit 230 repeatedly executes the processing from step S262 to step S264 until there is no state element that has not been selected. If there is no state element that has not yet been selected (No in step S261), the partial order procedure graph management unit 230 ends the partial order procedure graph post-processing.

[Description of effects]
The partial order procedure generation apparatus 200 of the present embodiment takes out a process in order from the beginning of a sequential procedure in which a system construction process or a system change process is arranged in series, and the extracted process is a partial order procedure addition unit 220. Is provided with a sequential procedure processing unit 210. The sequential procedure processing unit 210 generates a semi-order procedure in which the system construction process or the system change process is arranged in a semi-order structure based on the sequential procedure.

Further, when adding a system construction process or a system change process to the partial order procedure, the partial order procedure generation apparatus 200 according to the present embodiment provides information on the process performed last for each component in the system configuration. A partial order procedure adding unit 220 to be used is provided. The partial order procedure adding unit 220 can add a process without searching for a graph representing the partial order procedure.

In addition, the partial order procedure generation apparatus 200 according to the present embodiment holds a graph representing the partial order procedure, and the process performed first for each part in the system configuration and finally for each part in the system configuration. A semi-order procedure graph management unit 230 is provided for acquiring the steps to be performed.

The first effect of this embodiment will be described. Since the partial order procedure adding unit 220 according to the present embodiment determines the presence / absence of the order relation of each process group based on the type of the process group having the order relation, it can correctly determine the presence / absence of the order relation. Therefore, the partial order procedure production | generation apparatus 200 of this embodiment can avoid the problem that the change plan system described in patent document 1 misjudged the presence or absence of the order relationship of the process group.

Therefore, when the partial order procedure generation apparatus 200 according to the present embodiment is used, the change planning system described in Patent Document 1 is a case where the sequential procedure of system construction or system change cannot be correctly half-ordered. However, the sequential procedure is correctly semi-ordered.

The second effect of this embodiment will be described. The partial order procedure adding unit 220 of the present embodiment, when adding a system construction process or a system change process to the partial order procedure graph, displays information on the process executed last for each part in the system configuration. use. By utilizing the process information, the partial order procedure adding unit 220 can add a process without searching the partial order procedure graph.

When the partial order procedure generation device 200 of the present embodiment is used, the change planning system described in Patent Document 1 adds the steps included in the sequential procedure in the partial order procedure derivation process to the partial order procedure graph. The problem of long procedure derivation caused by searching the partial order procedure graph each time is solved.

Since the partial order procedure generation apparatus 200 according to the present embodiment can derive a procedure more efficiently than the change planning system described in Patent Document 1, the sequential procedure for system construction or system change can be performed in a shorter time. Can be ordered.

Hereinafter, a specific example of the hardware configuration of the partial order procedure generation device of each embodiment will be described. FIG. 9 is an explanatory diagram showing a hardware configuration example of the partial order procedure generation device according to the present invention.

9 includes a CPU (Central Processing Unit) 21, a main storage unit 22, and an auxiliary storage unit 23. Moreover, you may provide the input part 24 for a user to operate, and the output part 25 for showing a process result or progress of a process content to a user.

Note that the partial order procedure generation apparatus shown in FIG. 9 may include a DSP (Digital Signal Processor) instead of the CPU 21. Or the partial order procedure production | generation apparatus shown in FIG. 9 may be provided with CPU21 and DSP together.

The main storage unit 22 is used as a data work area and a temporary data save area. The main storage unit 22 is, for example, a RAM (Random Access Memory).

The auxiliary storage unit 23 is a tangible storage medium that is not temporary. Examples of the non-temporary tangible storage medium include a magnetic disk, a magneto-optical disk, a CD-ROM (Compact Disk Read Only Memory), a DVD-ROM (Digital Versatile Disk Read Only Memory), and a semiconductor memory.

The input unit 24 has a function of inputting data and processing instructions. The input unit 24 is an input device such as a keyboard or a mouse.

The output unit 25 has a function of outputting data. The output unit 25 is a display device such as a liquid crystal display device or a printing device such as a printer.

Further, as shown in FIG. 9, in the partial order procedure generation device, each component is connected to the system bus 26.

The auxiliary storage unit 23 includes, for example, a sequential procedure processing unit 110, a partial order procedure addition unit 120, a partial order procedure graph management unit 130, a sequential procedure processing unit 210, a partial order procedure addition unit 220, and a partial order procedure graph management unit 230. The program for realizing is stored.

In addition, the partial order procedure generation apparatus 100 and the partial order procedure generation apparatus 200 of each embodiment may be realized by the CPU 21 that executes processing according to a program stored in a non-temporary storage medium, for example. That is, the partial order procedure generation device 100 and the partial order procedure generation device 200 of each embodiment may be realized by software.

When realized by software, the CPU 21 loads a program stored in the auxiliary storage unit 23 to the main storage unit 22 and executes it, thereby controlling the operation of the partial order procedure generation device, thereby enabling each function to be performed by software. Realized. That is, the sequential procedure processing unit 110, the partial order procedure addition unit 120, the partial order procedure graph management unit 130, the sequential procedure processing unit 210, the partial order procedure addition unit 220, and the partial order procedure graph management unit 230 are, for example, program controlled. It implement | achieves by CPU21 which performs a process according to this.

Also, some or all of each component may be realized by a general-purpose circuit (circuitry IV), a dedicated circuit, a processor, or a combination thereof. These may be configured by a single chip or may be configured by a plurality of chips connected via a bus. Part or all of each component may be realized by a combination of the above-described circuit and the like and a program.

For example, each part in the partial order procedure generation device 100 and the partial order procedure generation device 200 of each embodiment may be realized by a hardware circuit. As an example, a sequential procedure processing unit 110, a partial sequence procedure adding unit 120, a partial sequence procedure graph managing unit 130, a sequential procedure processing unit 210, a partial sequence procedure adding unit 220, and a partial sequence procedure graph managing unit 230 are respectively connected to LSI ( Large Scale). Further, they may be realized by a single LSI.

When some or all of the constituent elements are realized by a plurality of information processing devices and circuits, the plurality of information processing devices and circuits may be centrally arranged or distributedly arranged. For example, the information processing apparatus, the circuit, and the like may be realized as a form in which each is connected via a communication network, such as a client and server system and a cloud computing system.

Next, the outline of the present invention will be described. FIG. 10 is a block diagram showing an outline of the partial order procedure generating apparatus according to the present invention. The semi-sequential procedure generation device 10 according to the present invention has a structure in which an order relationship is not given to a part of the steps constituting a sequential procedure in which steps for changing the system configuration are arranged in series. An addition unit 11 (for example, a sequential procedure processing unit 110) that adds to a graph representing a partial order procedure that is a procedure in which the steps are arranged in a partial order structure, and a set of steps that constitute the added step and the partial order procedure. And a determination unit 12 (for example, a partial order procedure addition unit 120) that determines that an order relationship exists in a set that satisfies a predetermined condition.

With such a configuration, the partial order procedure generation device can correctly determine whether or not there is an order relationship between process groups.

Further, the determination unit 12 may detect a set satisfying a predetermined condition by searching a graph representing a partial order procedure by a predetermined method.

With such a configuration, the partial order procedure generation device can give a directed edge to the partial order procedure graph by executing a depth-first search.

In addition, the determination unit 12 detects from among a set of processes performed last for a part constituting the system to be changed among the processes in which a set satisfying a predetermined condition is added and the processes constituting the partial order procedure. May be.

With such a configuration, the partial order procedure generation device can add a directed edge to the partial order procedure graph without performing a depth-first search.

Further, the predetermined condition may be that when one process included in the set is executed, the other process included in the set can be executed.

Also, the predetermined condition may be that when one process included in the set is executed, the other process included in the set becomes an unexecutable process.

Further, the predetermined condition may be that each state transition representing each of a plurality of steps included in the set is included in the same state element.

With such a configuration, the partial order procedure generation device can give a significant directed edge to the partial order procedure graph.

The partial order procedure generation device 10 is erroneous if the change planning system described in Patent Document 1 has an order relation in a set of state transitions having no order relation in the derivation of the partial order procedure for system construction or system change. The problem of judging can be solved.

The reason is that the partial order procedure generation apparatus 10 sorts out the types of state transition sets having an order relationship, and determines whether or not there is an order relationship between the state transitions based on the type. This is because it is possible to avoid misjudgment of the presence or absence.

In addition, the change planning system described in Patent Document 1 is a process of deriving a partial order procedure for system construction or system change, and the state transition in a state transition sequence representing a sequential procedure is shown as a partial order procedure graph. Search for a partial order procedure graph each time it is added. The change planning system described in Patent Document 1 manages a partial order procedure using a partial order procedure graph. The partial order procedure generation device 10 can improve the problem that it takes time to derive a procedure because of the above efficiency.

The reason is that, when the partial order procedure generation device 10 adds a state transition of system construction or system change to the partial order procedure graph, the information on the last process performed for each part in the system configuration is used. This is because the state transition can be added without searching the partial order procedure graph.

Although the present invention has been described with reference to the embodiments and examples, the present invention is not limited to the above embodiments and examples. Various changes that can be understood by those skilled in the art can be made to the configuration and details of the present invention within the scope of the present invention.

This application claims priority based on Japanese Patent Application No. 2017-117607 filed on June 15, 2017, the entire disclosure of which is incorporated herein.

Industrial applicability

The present invention is suitably applied to a design support application when a system composed of a plurality of parts represented by an IT (Information Technology) system is constructed or changed. In particular, the present invention is preferably applied to partial ordering of sequential procedures for system construction or system change.

10, 100, 200 Semi-sequential procedure generation device 11 addition unit 12 determination unit 21 CPU
22 Main storage unit 23 Auxiliary storage unit 24 Input unit 25 Output unit 26 System bus 110, 210 Sequential procedure processing unit 120, 220 Semi-order procedure addition unit 130, 230 Semi-order procedure graph management unit

Claims (10)

1. A procedure in which processes are arranged in a semi-ordered structure, which is a structure in which sequential relations are not provided between some processes, which constitute a sequential procedure in which processes for changing the system configuration are arranged in series An additional part to be added to the graph representing the partial order procedure that is
   A partial order procedure generation apparatus comprising: a determination unit that determines that an order relation exists in a set that satisfies a predetermined condition among a set of steps that configure the added step and the partial order procedure.
2. The partial order procedure production | generation apparatus of Claim 1. A determination part detects the group which satisfy | fills predetermined conditions by searching the graph showing a partial order procedure by a predetermined method.
3. The determination unit detects a set that satisfies a predetermined condition from among a set of processes that are performed last for a part that constitutes a system to be changed among the added process and the process that configures the partial order procedure. The partial order procedure production | generation apparatus of 1 description.
4. The predetermined condition is that when one process included in the set is executed, the other process included in the set becomes an executable process. The partial order procedure production | generation apparatus of description.
5. The predetermined condition is that when one process included in the set is executed, the other process included in the set becomes an unexecutable process. The partial order procedure generator described in 1.
6. The predetermined condition is that each state transition representing each of a plurality of steps included in the set is included in the same state element. The partial order according to any one of claims 1 to 5. Procedure generator.
7. A procedure in which processes are arranged in a semi-ordered structure, which is a structure in which sequential relations are not provided between some processes, which constitute a sequential procedure in which processes for changing the system configuration are arranged in series To the graph that represents the partial order steps that are
   A method for generating a partial order procedure, comprising: determining that an order relation exists in a set satisfying a predetermined condition among a set of steps constituting the added step and the partial order procedure.
8. The method for generating a partial order procedure according to claim 7, wherein a set satisfying a predetermined condition is detected by searching a graph representing the partial order procedure by a predetermined method.
9. On the computer,
   A procedure in which processes are arranged in a semi-ordered structure, which is a structure in which sequential relations are not provided between some processes, which constitute a sequential procedure in which processes for changing the system configuration are arranged in series Additional processing to be added to the graph representing the partial order procedure, and determination processing for determining that there is an order relation in the set satisfying a predetermined condition from the set of the added process and the process constituting the partial order procedure. A partial sequence procedure generator program.
10. On the computer,
    The program for generating a partial order procedure according to claim 9, wherein a detection process for detecting a set that satisfies a predetermined condition by searching a graph representing the partial order procedure by a predetermined method is executed.

Images