WO2018230298A1 - Dispositif, procédé et programme de génération de procédure partiellement ordonnée - Google Patents

Dispositif, procédé et programme de génération de procédure partiellement ordonnée Download PDF

Info

Publication number
WO2018230298A1
WO2018230298A1 PCT/JP2018/020034 JP2018020034W WO2018230298A1 WO 2018230298 A1 WO2018230298 A1 WO 2018230298A1 JP 2018020034 W JP2018020034 W JP 2018020034W WO 2018230298 A1 WO2018230298 A1 WO 2018230298A1
Authority
WO
WIPO (PCT)
Prior art keywords
procedure
partial order
state
order procedure
partial
Prior art date
Application number
PCT/JP2018/020034
Other languages
English (en)
Japanese (ja)
Inventor
豊 八鍬
拓也 桑原
Original Assignee
日本電気株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 日本電気株式会社 filed Critical 日本電気株式会社
Publication of WO2018230298A1 publication Critical patent/WO2018230298A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Definitions

  • the present invention relates to a partial order procedure generation device, a partial order procedure generation method, and a partial order procedure generation program.
  • 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.
  • 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.
  • construction work or modification work 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the Tomcat package and Ubuntu VM are defined.
  • state model is described as “state machine group”
  • 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.
  • a black ellipse represents a request state.
  • solid arrows between ellipses represent state transitions.
  • a dashed arrow between rectangles represents dependency.
  • the current state of each state element is defined as state f
  • 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.
  • 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.
  • FIG. 11 describes a state element Tomcat whose type is Package and a state element Ubuntu whose type is VM.
  • 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
  • the state element A depends on the state element B
  • It is expressed as “having sex”.
  • 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.
  • state model conversion is described as “state machine group conversion”.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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)”.
  • dependent state transition 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”.
  • 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.
  • 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.
  • 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.
  • the ID of the state element shown in FIG. 12 is described in a rectangle located on the rectangle representing the state element.
  • 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.
  • 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.
  • 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 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.
  • 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).
  • 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 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.
  • a determination unit that determines that there exists.
  • the partial order procedure generation method 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.
  • the partial order procedure generation program 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.
  • 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.
  • the state transition executed first is the state transition from state t to state f of state element A
  • the state transition executed later is from state t to state f of state element B.
  • the above order relationship 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.
  • the state transition executed first is the state transition from state t to state f of state element B
  • the state transition executed later is from state f of state element A to state t.
  • the above order relationship 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.
  • the state transition executed first is the state transition from state t to state f of state element A
  • the state transition executed later is from state f of state element A to state t.
  • 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.
  • 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.
  • the above-described order relationship is established.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • a process corresponds to a node of the graph.
  • a directed edge is drawn from a node of a dependent process toward a node of the dependent process.
  • 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.
  • 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.
  • the partial order procedure generation apparatus 100 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).
  • 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).
  • 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.
  • 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).
  • the partial order procedure generation apparatus 100 ends the partial order procedure graph output process.
  • 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.
  • 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).
  • 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).
  • 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).
  • 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). ).
  • 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).
  • 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). ).
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the partial order procedure adding unit 120 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.
  • the partial order procedure adding unit 120 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
  • the semi-sequence procedure generation device 100 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.
  • 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.
  • 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.
  • the partial order procedure generation apparatus 200 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.
  • 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.
  • the semi-order procedure addition unit 220 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.
  • processes correspond to the nodes of the graph.
  • 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.
  • the partial order procedure generation device 200 may be communicably connected to an input device, an output device, and a storage device.
  • 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.
  • the partial order procedure generation apparatus 200 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).
  • 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).
  • 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).
  • 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.
  • 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).
  • 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.
  • 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.
  • 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).
  • 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).
  • 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.
  • the state of the state element before the added process is executed may be any state other than the current state.
  • 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.
  • 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.
  • 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).
  • 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).
  • 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). ).
  • 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).
  • 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). ).
  • 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).
  • step S258 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.
  • 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).
  • 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).
  • 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).
  • 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. .
  • step S25D 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.
  • 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.
  • 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).
  • 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).
  • 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).
  • 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.
  • 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.
  • the partial order procedure generation apparatus 200 when adding a system construction process or a system change process to the partial order procedure, 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.
  • the partial order procedure generation apparatus 200 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 partial order procedure adding unit 220 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
  • 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 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.
  • 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.
  • the partial order procedure generation apparatus 200 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.
  • FIG. 9 is an explanatory diagram showing a hardware configuration example of the partial order procedure generation device according to the present invention.
  • partial order procedure generation apparatus shown in FIG. 9 may include a DSP (Digital Signal Processor) instead of the CPU 21.
  • DSP Digital Signal Processor
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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
  • 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.
  • 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.
  • 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.
  • the plurality of information processing devices and circuits may be centrally arranged or distributedly arranged.
  • 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.
  • 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.
  • 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.
  • the partial order procedure generation device can correctly determine whether or not there is an order relationship between process groups.
  • 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.
  • the partial order procedure generation device can give a directed edge to the partial order procedure graph by executing a depth-first search.
  • 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.
  • the partial order procedure generation device can add a directed edge to the partial order procedure graph without performing a depth-first search.
  • 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.
  • 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.
  • 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.
  • 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 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.
  • 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.
  • 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.
  • IT Information Technology
  • the present invention is preferably applied to partial ordering of sequential procedures for system construction or system change.

Abstract

La présente invention concerne un dispositif de génération de procédure partiellement ordonnée (10) pourvu : d'une unité d'ajout (11) servant à ajouter des étapes constituant une procédure séquentielle dans laquelle des étapes servant à changer une configuration de système sont agencées en série dans un graphique qui représente une procédure partiellement ordonnée dans laquelle les étapes sont agencées dans une structure partiellement ordonnée dans laquelle, entre certaines des étapes, aucune relation d'ordre n'est donnée ; et d'une unité de détermination (12) servant à déterminer qu'une relation d'ordre, qui satisfait une condition prescrite, existe dans un ensemble, parmi des ensembles des étapes ajoutées et des étapes constituant la procédure partiellement ordonnée.
PCT/JP2018/020034 2017-06-15 2018-05-24 Dispositif, procédé et programme de génération de procédure partiellement ordonnée WO2018230298A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2017117607 2017-06-15
JP2017-117607 2017-06-15

Publications (1)

Publication Number Publication Date
WO2018230298A1 true WO2018230298A1 (fr) 2018-12-20

Family

ID=64659056

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2018/020034 WO2018230298A1 (fr) 2017-06-15 2018-05-24 Dispositif, procédé et programme de génération de procédure partiellement ordonnée

Country Status (1)

Country Link
WO (1) WO2018230298A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006195892A (ja) * 2005-01-17 2006-07-27 Fuji Xerox Co Ltd フロー処理プログラム、装置およびフロー順序変更方法
WO2013128838A1 (fr) * 2012-03-01 2013-09-06 日本電気株式会社 Dispositif de création de procédure de construction de système, procédé de création de procédure de construction de système et programme
JP2015215885A (ja) * 2014-05-09 2015-12-03 日本電気株式会社 変更計画システム、変更計画方法および変更計画プログラム

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006195892A (ja) * 2005-01-17 2006-07-27 Fuji Xerox Co Ltd フロー処理プログラム、装置およびフロー順序変更方法
WO2013128838A1 (fr) * 2012-03-01 2013-09-06 日本電気株式会社 Dispositif de création de procédure de construction de système, procédé de création de procédure de construction de système et programme
JP2015215885A (ja) * 2014-05-09 2015-12-03 日本電気株式会社 変更計画システム、変更計画方法および変更計画プログラム

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KATSUNO, YASUHARU ET AL.: "Rapid deployment of composite application server with installation dependency", IEICE TECHNICAL REPORT, vol. 115, no. 61, 21 May 2015 (2015-05-21), pages 101 - 108, ISSN: 0913-5685 *

Similar Documents

Publication Publication Date Title
JP2021099890A (ja) 因果関係の判別方法、装置、電子機器及び記憶媒体
EP3696745A1 (fr) Conseiller intelligent de flux de travail pour la conception, la simulation et la fabrication de pièces
JP2016115175A (ja) ソフトウェアテスト装置およびソフトウェアテストプログラム
JP6631527B2 (ja) 情報処理装置、情報処理方法、及び、プログラム
US11562028B2 (en) Concept prediction to create new intents and assign examples automatically in dialog systems
JP2021128779A (ja) データ拡張の方法及び装置、機器、記憶媒体
CN104598661B (zh) 用于涉及it系统的项目的变更请求分析的方法和装置
WO2018230298A1 (fr) Dispositif, procédé et programme de génération de procédure partiellement ordonnée
CN113691403B (zh) 拓扑节点配置方法、相关装置及计算机程序产品
JP2013003611A (ja) 設計検証方法及びプログラム
US11403270B2 (en) System configuration derivation device, method, and program
US11194624B2 (en) Partial order procedure planning device, partial order procedure planning method and partial order procedure planning program
WO2018230352A1 (fr) Dispositif de production de procédure de changement, procédé de production de procédure de changement, et programme de production de procédure de changement
JP2022065641A (ja) ネットワークオペレータ処理方法、装置、電子デバイス、記憶媒体及びプログラム
CN109189370B (zh) 软件组件的生成方法、装置、设备及计算机可读存储介质
KR20220029004A (ko) 클라우드 기반 딥러닝 작업의 수행시간 예측 시스템 및 방법
WO2020057104A1 (fr) Procédé et dispositif de développement d'applications
US20220351054A1 (en) Systems and methods for generating customer journeys for an application based on process management rules
JPWO2016079962A1 (ja) モデル検査装置、モデル検査方法、および、モデル検査プログラム
WO2023209994A1 (fr) Dispositif de conception de système, procédé de conception de système et support d'enregistrement
WO2022239235A1 (fr) Dispositif de calcul de quantité de caractéristiques, procédé de calcul de quantité de caractéristiques et programme de calcul de quantité de caractéristiques
JP7215578B2 (ja) 障害切り分けシステム、方法およびプログラム
CN110765098B (zh) 流程运行预测系统及方法
US8782579B2 (en) Connection verification method, recording medium thereof, and connection verification apparatus
CN116401025A (zh) 一种数据处理系统及数据处理方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18817995

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18817995

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP