[0001] An information technology (IT) environment may be managed in various ways. In some examples, the IT environment may be managed by creating an IT workflow to accomplish tasks of a process in the IT environment.

BRIEF DESCRIPTION

[0002] Some examples are described with respect to the following figures:

[0003] FIG. 1 is a block diagram illustrating a non-transitory computer readable storage medium according to some examples.

[0004] FIGS. 2 and 4 are block diagrams illustrating systems according to some examples.

[0005] FIGS. 3 and 5 are flow diagrams illustrating methods according to some examples.

DETAILED DESCRIPTION

[0006] The following terminology is understood to mean the following when recited by the specification or the claims. The singular forms "a," "an," and "the" mean "one or more." The terms "including" and "having" are intended to have the same inclusive meaning as the term "comprising."

[0007] An IT workflow may be defined in IT workflow data, which provides a representation of a state machine that includes information on valid states (e.g. actions in an IT process) and how to transition between those states (e.g. relationships between the actions). The IT workflow may operate on an underlying system, such as an IT environment.

[0008] IT workflows may be classified into workflow types, which are based on the type of IT process to be executed in the IT workflow. For example, a workflow type may define which IT offering the IT workflow may implement. Example IT offerings include requests for IT service, requests for IT support, and requests for IT change. Other types of IT offerings may also be provided by IT workflows within the context of an IT management system, such as an information technology operations management (ITOM) system or an information technology service management (ITSM) system. [0009] Each of the IT workflow data, based on its workflow type, may include IT workflow logic to implement its associated IT offering. In some examples, each state and transition of the IT workflow data may include IT workflow logic to run when in the state or transition. IT workflow logic may include a rule or an ordered list of rules to run when in the state or transition.

[0010] In some examples, IT workflow data representing model IT workflows may be provided, e.g. by a vendor along with IT management application. A model IT workflow may be a predetermined out-of-the-box IT workflow of a particular workflow type. Model IT workflows may implement any of the example IT offerings described earlier. For example, model IT workflow data for IT service requests may be provided.

[0011] In some examples, because some model IT workflows may be associated with broad or generic workflow types, users may wish to create a user-customized IT workflow data. In some examples, a user may create a user-customized IT workflow data, for example by modifying model IT workflow data. For example, model IT workflow data may be modified to comply with particular infrastructure requirements such as specification requirements for hardware components, and/or prior authorizations for hardware purchases, among others. In some examples, a user may add or delete IT workflow logic blocks, which may include at least one rule, into or from states and/or transitions in the IT workflow data,

[0012] In an example, an upgraded IT management application may be provided with new model IT workflow data relative those provided with a previous version of the IT management application. A user may attempt to migrate the user-customized IT workflow data used with the previous version of the IT management application so that they can be used with the upgraded IT management application. However, the user-customized IT workflow data may be similar to the new model IT workflow data provided with the upgraded IT management application.

[0013] Accordingly, the present disclosure provides examples in which a similarity score may be determined between user-customized IT workflow data and model IT workflow data. The examples include various effective methods for analyzing rules and determining similarity scores, and such methods may be used in various combinations. Therefore, in some examples, a user may use the model IT workflow data if it is sufficiently similar to the user-custom zed IT workflow data. In some examples, model IT workflows may be optimized for superior function relative to user-customized IT workflows, e.g. because model IT workflows may include metadata that is useful for superior function.

[0014] FIG. 1 is a block diagram illustrating a non-transitory computer readable storage medium 10 according to some examples. The non-transitory computer readable storage medium 10 may include instructions 12 executable by a processor to identify a first segment of computer language text in a first rule in IT workflow data and a second segment of computer language text in a second rule in the IT workflow data, identification of a segment is understood herein to include either receiving the segment or parsing the rule to identify the segment. The non-transitory computer readable storage medium 10 may include instructions 14 executable by a processor to determine a similarity score between the first and the second rules based on a comparison of the first segment with the second segment. The non-transitory computer readable storage medium 10 may include instructions 16 executable by a processor to, in response to the similarity score exceeding a threshold, cause the first rule to be selectable to manage an IT environment.

[0015] FIG. 2 is a block diagram illustrating a system 20 according to some examples. The system 20 may include a processor 22 and a memory 24. The memory 24 may include instructions 26 executable by the processor to determine a similarity score between first and second rules in IT workflow data based on a comparison of first segments in the first rule with second segments in the second rule, the first and second rules each including a condition clause and an action clause, the first segments and second segments each including domain-specific language text. The memory 24 may include instructions 28 executable by the processor to determine whether the similarity score exceeds a threshold. The memory 24 may include instructions 29 executable by the processor to, in response to the similarity score exceeding the threshold, generate a visual notification to a user.

[0016] FIG. 3 is a flow diagram illustrating a method 30 according to some examples. The following may be performed by a processor. At 32, first segments in a first rule in model IT workflow data and second segments in a second rule in user-customized IT workflow data may be identified. The first and the second segments may including computer language text. At 34, first and second similarity scores may be determined between the first and the second rules based on respective first and second types of comparisons of the first segments with the second segments. At 36, a third similarity score may be determined between the first and the second rules based on a weighted average of the first and the second similarity scores. At 38, in response to the third similarity score exceeding a threshold, indicate to a user that the first rule is selectable to manage an IT environment.

[0017] FIG. 4 is a block diagram illustrating a system 100 according to some examples. The system 100 includes a similarity scoring system 101. The similarity scoring system 101 may include an IT workflow receiver 102, rule processor 104, first similarity score determiner 106, second similarity score determiner 1 14, third similarity score determiner 122, fourth similarity score determiner 124, and rule selector 125. The first similarity score determiner 106 may include DSL Levenshtein distance determiner 108, DSL Dice coefficient determiner 110, and score determiner 1 12. The second similarity score determiner 114 may include String Levenshtein distance determiner 116, map and list Dice coefficient determiner 1 18, and score determiner 120. In various examples, additional elements may be added and/or some of the elements described above may be omitted,

[0018] In some examples, these components of the similarity scoring system 101 may be implemented as a computing system including a processor, a memory such as non- transitory computer readable medium coupled to the processor, and instructions such as software and/or firmware stored in the non-transitory computer-readable storage medium. The instructions may be executable by the processor to perform processes defined herein. In some examples, the components may include hardware features to perform processes described herein, such as a logical circuit, application specific integrated circuit, etc. In some examples, multiple components may be implemented using the same computing system features or hardware.

[0019] In some examples, the IT workflow receiver 102 (e.g. an application programming interface (API), such as the REST API, of the similarity scoring system 101 ) may receive, through a communication interface, IT workflow data 126 representing a user-customized IT workflow and IT workflow data 128 representing a model IT workflow from a data source via a communication network. The data source may be an IT management application running on a computing device in the similarity scoring system 101 , such as a server in a data center, a personal computer, or the like. In other examples, the IT management application may and the similarity scoring system 101 may be included in the same computing device or system. As discussed earlier, the IT workflow data 128 representing the model IT workflow may be provided with the IT management application by a vendor, whereas the IT workflow data 126 representing the user-customized IT workflow may be created by a user for use with the IT management application. In some examples, the user may generate the IT workflow data 126 using the IT management application.

[0020] Each of the IT workflow data 126 and 128 may include IT workflow logic to implement its respective associated IT offering. As discussed earlier, in some examples, some or each of the states and transitions of each of the IT workflow data 126 and 128 may include IT workflow logic to run when in the state or transition. IT workflow logic may include a rule or an ordered list of rules to run when in the state or transition. IT workflow logic may include instructions, such as data structures or functions, which produce a part of an IT workflow. As shown in FIG. 4, the IT workflow data 126 may include rule 130 and metadata 134, and the IT workflow data 128 may include rule 132 and metadata 136.

[0021] In some examples, the rules may written in various computer languages, including combinations of different computer languages. A computer language is understood herein to be any language for communicating instructions on a computer, in some examples, some rules may include non-scripted declarative language, which is a computer language other than a scripted language and is descriptive in nature. For example, a non-scripted declarative rule may read "If a request is made for a new device, then the request must be approved by a manager." in some examples, rules may be written in a general-purpose language (GPL), which is a computer language that is applicable across domains, and may lack specialized features for a particular domain, in some examples, the rules may be written in a domain-specific language (DSL) which is a computer language that is suitable for a particular domain, such as for usage with the IT management application.

[0022] Rules are defined herein to include condition clauses and action clauses. A condition clause includes at least one logical condition to be satisfied, and an action clause includes at least one action to be performed in response to the condition being satisfied. Each of the condition clauses and action clauses may include sequences of segments drawn from several categories, including but not limited to: (1 ) conditional expressions, which represent logical conditions to be satisfied (e.g. in a DSL); (2) conjunctions, such as "and", "or", "xor", "if, etc.; (3) parameters, such as a variable (e.g. written as a string), a value to which the variable is to be set (e.g. in a DSL), a map parameter, and a list parameter; (4) prepositions, such as "to", etc.; and (5) actions, such as "set", "validate", etc.

[0023] In an example, Table 1 depicts the rule 130 in the IT workflow data 128 representing the model IT workflow, and Table 2 depicts the rule 132 in the IT workflow data 128 representing the user-customized IT workflow. Each of the IT workflow data 126 and 128 may include additional rules relative to respective rules 130 and 132 such that they each include an ordered list of rules.

Table 1 : Rule 130 in IT Workflow Data 126 Representing Mode! IT

Workflow

if ${current__update. Solution. IsChanged and (current_update. Solution. NewValue == 'NoSuchSolution' or entity. Category == 'Category2 ^! |j entity. Category == ategory )} Set Solution to ${current__update. Solution. OldValue}

Table 2: Rule 132 so IT Workflow Data 128 Representing User-Customized IT

Workflow

If ${current_update. Solution. IsChanged && (current_update. Solution. NewValue =

'NoSuchSolution' jj entity. Category == ategory )}

Set Solution to ${current_update. Solution. OldVaiue}

[0024] The example rule 130 states that (1 ) if a Solution parameter has been changed, and (2) if the changed value of the Solution is "no solution" or if the parameter associated with the IT environment (i.e. entity category) on which the IT workflow runs is of a first or second value; then the Solution parameter is to be set to its previous value (the value if had before being changed). The example rule 132 states that (1 ) if a Solution parameter has been changed, and (2) if the changed value of the Solution is "no solution" or if parameter associated with the IT environment (i.e. entity category) on which the IT workflow runs is of a first value; then the Solution parameter is to be set to its previous value (the value it had before being changed). [002S] As discussed earlier, the IT workflow data 126 and 128 may include respective metadata 134 and 136, which may parse segments of the respective rules 130 and 132, and specify the category of each segment. Example parsing and categorization of each segment of the rules 130 and 132 provided by the metadata 34 and 136 are shown in Tables 3 and 4.

Table 3: Rule 130 and Associated Metadata 134

Table 4: Rule 132 and Associated Metadata 136

[0026] In the examples of Tables 1 -4, map and list parameters are not shown. A map parameter includes (e.g. after the action "Set") a variable and a value to which the variable is to be set, and e.g. separated by a separator such as a colon. The map parameter may include several pairs of variables and values. The map parameter may be part of an action clause. An example map parameter is "Set ExpertAssignee: ${entity.AssignedPerson} CurrentAssignment: ExpertGroup". A list parameter includes (e.g. after the action "Validate") a variable and a list of values. The list parameter may be part of an action clause. An example list parameter is "Validate that Current Assignment is in Service Desk, Expert Group, or Incident". In this example, the variable "Current Assignment" is checked to see if it has a value from the list of values "Service Desk", "Expert Group", or "incident".

[0027] In some examples, the similarity scoring system 101 may support direct user interaction. For example, the similarity scoring system 101 may include user input device 138, such as a keyboard, touchpad, buttons, keypad, dials, mouse, track-bail, card reader, or other input devices. Additionally, the similarity scoring system 101 may include output device 140 such as a liquid crystal display (LCD), video monitor, touch screen display, a light-emitting diode (LED), or other output devices. The output devices may be responsive to instructions to display textual information or graphical data. The output device 140 may include a viewing area 142 to allow a user to view the user customized IT workflow data 126 and the model IT workflow data 128. As shown in FIG. 4, each of the IT workflows 126 and 128 is shown to include a respective ordered list 144 and 146 of three rules, with respective rules 130 and 132 in the middle of the ordered lists 144 and 146. The ordered lists 144 and 146 are provided with visual labels identifying the lists as part of either the user-customized IT workflow or the model IT workflow.

[0028] In some examples, the rule processor 104 may process the rules for use by the score determiners 106, 1 14, 122, and 124. For example, the rule processor 104 may identify segments that are synonyms and replace them with a single same segment. For example, the rule processor 104 may identify that the conjunctions "and" and "&&" (respectively in rule 130 and 132) as "and" and therefore replace instances of "&&" with "and". The rule processor 104 may also identify that the conjunctions "||" and "or" (in rules 130 and 132) as "or", and therefore replace instances of "jj" with "or. The similarity scoring system 101 may additionally identify any other synonyms before performing similarity score analyses.

[0029] In some examples, the processing by the rule processor 104 may include identifying when similar segments, such as the DSL condition expression "entity. Category == 'Categoryl '", appear in different rules 130 and 132 in different locations, but nevertheless serve the same logical function in the rule. Upon such an identification, the rule processor 104 may determine that these segments are to form the basis of comparisons by the score determiners 106, 1 14, 122, and 124, which may then generate the same similarity score regardless of whether clauses and segments appear in different locations in different rules, so long as the difference in location does not contribute to any difference in the logical function of the rules.

[0030] In some examples, the processing by the rule processor 104 may include, for rules without corresponding metadata, the rule processor 104 may parse the rules by identifying clauses, segments, and spaces between segments, and generate metadata for the rules similar to that shown in Tables 3 and 4.

[0031] The similarity scoring system 101 is shown in FIG. 4 to include four similarity score determiners 106, 1 14, 122, and 124, but in other examples some of these similarity score determiners may be removed and/or others may added. Therefore, the similarity scoring system 101 is flexible in that it may incorporate various types of similarity score determiners to customize the final similarity score determination. As will be discussed, several parameters such as weights to be applied to different similarity scores and other values may be predetermined or selectable by a user. In some examples, the user may save a user profile with a user customized set of weights and/or selections of which similarity score determiners to use when determining a final similarity score.

[0032] The first similarity score determiner 106 may determine a first similarity score between the rule 130 in the IT workflow data 126 and a corresponding rule 132 in the IT workflow data 128. First similarity scores may also be determined for additional rule pairs across the IT workflow data 126 and 128. The first similarity score determiner 106 may perform these processes using its DSL Levenshtein distance determiner 108, DSL Dice coefficient determiner 1 10, and score determiner 112. Whether rules are "corresponding" may be determined based on their respective locations in the IT workflow data 126 and 128, e.g. whether they are found within a similar or same location or context in the IT workflow data 126 and 128. However, in some examples, each rule in the IT workflow data 128 may be compared to some or all of the rules in the IT workflow data 126, such that the first similarity score determiner 106 may, for a given rule in the IT workflow data 128, find a corresponding rule in the IT workflow data 126 with a highest similarity score, as will be discussed. The following example will discuss a first similarity score determination between the rules 130 and 132, but such a determination may be made for any other rule pairs discussed above.

[0033] The DSL Levenshtein distance determiner 108 may determine the Levenshtein distance between rules 130 and 132. The Levenshtein distance between two texts is defined herein as the minimum number of single character edits (e.g. insertions, deletions, and/or substitutions) to transform between the texts, in some examples, the Levenshtein distance between the entire rules 130 and 132 may be determined, in some examples, the Levenshtein distance between respective portions of the rules 130 and 132 may be determined. In some examples, the respective portions may comprise segments (e.g. all texts or DSL texts) in the condition clauses. In some examples, the respective portions may comprise the DSL text in each of the rules 130 and 132. For example, the Levenshtein distance may be determined between the 5 DSL texts (4 DSL conditional expressions and 1 DSL parameter) in the rule 130 and the 4 DSL texts (3 DSL conditional expressions and 1 DSL parameter) in the rule 132. In some examples, the respective portions may additionally any combinations of DSL texts, strings, parameters, conditional expressions, conjunctions, actions, and/or other segments, etc. in some examples, the DSL Levenshtein distance determiner 108 may normalize the determined Levenshtein distance to a value between 0 (completely different, e.g. if every character in the first text is changed to transform to the second text) and 1 (identical, e.g. if no characters are transformed).

[0034] The DSL Dice coefficient determiner 1 10 may determine the Dice coefficient between rules 130 and 132. The Dice coefficient between two texts (e.g. two rules) is defined herein as twice the number of terms (e.g. segments) common to the texts being compared, divided by the total number of terms in the texts (i.e. a first number of terms in the first text plus a second number of terms in the second text), in some examples, the Dice coefficient between the entire rules 130 and 132 may be determined. In other examples, the Dice coefficient distance between respective portions of the rules 130 and 132 may be determined. In some examples, the respective portions may comprise segments (e.g. all texts or DSL texts) in the condition clauses. In some examples, the respective portions may comprise the DSL text in each of the rules 130 and 132. For example, the Dice coefficient may be determined between the 5 DSL texts (4 DSL conditional expressions and 1 DSL parameter) in the rule 130 and the 4 DSL texts (3 DSL conditional expressions and 1 DSL parameter) in the rule 132. In some examples, the respective portions may additionally any combinations of DSL texts, strings, parameters, conditional expressions, conjunctions, actions, and/or other segments, etc. The Dice coefficient may be between 0 (completely different, e.g. no common texts) and 1 (identical, e.g. all texts are common).

[003S] The score determiner 1 12 may determine a first similarity score based on the Levenshtein distance determined by the DSL Levenshtein distance determiner 108 and the Dice coefficient determined by the DSL Dice coefficient determiner 1 10. in some examples, the first similarity score may comprise a sum of a first weight a (where a is between 0 and 1 ) multiplied by the Levenshtein distance plus a second weight b (where b = 1 - a) multiplied by the Dice coefficient, in some examples, both a and b may be equal to 0.5. In some examples, the first and second weights may be predetermined or may be set by a user via the input device 138 of the similarity scoring system 101. In some examples, the score determiner 1 12 may add a predetermined bonus amount (e.g. 0.1 points) to the first similarity score in response to the rule of the user-customized IT workflow being completely contained (or a threshold amount of the rule is contained) within the rule of the model IT workflow. In the example of Tables 1 -4, all segments of the rule 130 of the user-customized IT workflow data 128 are contained in the rule 132 of the model IT workflow data 128.

[0036] In some examples, using both the DSL Levenshtein distance determiner 108 and the DSL Dice coefficient determiner 110 for determining the first similarity score may provide a robust and reliable score. For example, the Levenshtein distance may be more accurate when the segments are different but in small part, such as "entity.xl == null" vs. "entity.x2 == null ^" . On the other hand, the Dice coefficient may be more accurate when the segments have switched places but the meaning of the segments remain identical, for example "entity. Category == 'Categoryl '" in rules 130 and 132.

[0037] The second similarity score determiner 1 14 may determine a second similarity score between the rule 130 in the IT workflow data 126 and the corresponding rule 132 in the IT workflow data 128. Second similarity scores may also be determined for additional rule pairs across the IT workflow data 126 and 128. The second similarity score determiner 1 14 may perform these processes using its string Levenshtein distance determiner 1 16, map and list Dice coefficient determiner 118, and score determiner 120. However, in some examples, each rule in the IT workflow data 128 may be compared to some or all of the rules in the IT workflow data 126, such that the second similarity score determiner 1 14 may, for a given rule in the IT workflow data 128, find a corresponding rule in the IT workflow data 126 with a highest similarity score, as will be discussed. The following example will discuss a second similarity score determination between the rules 130 and 132, but such a determination may be made for any other rule pairs discussed above.

[0038] The string Levenshtein distance determiner 1 16 may determine the Levensthein distance between rules 130 and 132. In some examples, the Levenshtein distance between respective portions of the rules 130 and 132 may be determined, in some examples, the respective portions may comprise segments comprising strings (e.g. parameters written as strings) of the rules 130 and 132. For example, the strings in rules 130 and 132 may include the string parameter "Solution". In some examples, the respective portions may additionally any combinations of DSL texts, strings, parameters, conditional expressions, conjunctions, actions, and/or other segments, etc. In some examples, the string Levenshtein distance determiner 108 may normalize the determined Levenshtein distance to a value between 0 (completely different, e.g. if every character in the first text is changed to transform to the second text) and 1 (identical, e.g. if no characters are transformed).

[0039] The map and list Dice coefficient determiner 1 18 may determine the Dice coefficient between rules 130 and 132. In some examples, the Dice coefficient distance between respective portions of the rules 130 and 132 may be determined. In some examples, the respective portions may comprise map and/or list parameters in the rules 130 and 132. In the example of rules 130 and 132, no map and list parameters are present, however example map and list parameters such as those described earlier may be analyzed in other example rules. In some examples, the respective portions may additionally any combinations of DSL texts, strings, parameters, conditional expressions, conjunctions, actions, and/or other segments, etc, in some examples, the map and list Dice coefficient determiner 118 may add a predetermined bonus amount (e.g. 0, 1 points) to the Dice coefficient in response to the map and list parameters of the user-customized IT workflow being completely contained (or a threshold amount of the map and list parameters is contained) within the rule of the model IT workflow. The Dice coefficient may be between 0 (completely different, e.g. no common texts) and 1 (identical, e.g. ail texts are common).

[0040] The score determiner 120 may determine a second similarity score based on the Levenshtein distance determined by the string Levenshtein distance determiner 1 16, the Dice coefficient determined by the map and list Dice coefficient determiner 1 18, and a first similarity score determined by the first similarity score determiner 106, wherein the first similarity score may be determined by based on comparisons of DSL texts but no other texts. In some examples, the second similarity score may comprise a sum of a first weight c (where c is between 0 and 1 ) multiplied by the Levenshtein distance plus a second weight d (where d is between 0 and 1 ) multipiied by the Dice coefficient plus a third weight e (where e is between 0 and 1 , and e = 1 - c - d) multiplied by the first similarity score, in some examples, each of c, d, and e may be equal to 1/3. In some examples, the first, second, and third weights may be predetermined or may be set by a user via the input device 138 of the similarity scoring system 101.

[0041] In some examples, using the combination of the string Levenshtein distance determiner 1 16, map and list Dice coefficient determiner 1 18, and first similarity score determiner 106 for determining the second similarity score may provide a robust and reliable score, for similar reasons as discussed earlier relative to score determiner 1 12.

[0042] In some examples, the first similarity score may be determined based on segments in the condition clause while the second similarity score may be determined based on segments in the action clause, in which case the first similarity score may be regarded as a condition similarity score and the second similarity score may be regarded as an action similarity score,

[0043] The third similarity score determiner 122 may determine a third similarity score between the rule 130 in the IT workflow data 126 and the rule 132 in the IT workflow data 128, based on the first similarity score determined by the score determiner 1 12 and the second similarity score determined by the score determiner 120. Third similarity scores may also be determined for additional rule pairs across the IT workflow data 126 and 128, for any of the pairs described earlier relative to the first and second similarity score determiners 1 12 and 120. in some examples, the third similarity score may comprise a sum of a first weight f (where f is between 0 and 1 ) multiplied by the first similarity score plus a second weight g (where g = 1 - f) multiplied by the second similarity score. In some examples, both f and g may be equal to 0.5. In some examples, the first and second weights may be predetermined or may be set by a user via the input device 138 of the similarity scoring system 101.

[0044] The fourth similarity score determiner 124 may determine a fourth similarity score between the rule 130 in the IT workflow data 126 and the rule 132 in the IT workflow data 128, based on a weighted average of third similarity scores of the rules pair 130 and 132 themselves and the third similarity scores of rule pairs within a threshold distance of the one of the rule pairs. In some examples, the fourth similarity score may provide for a higher similarity score when rule pairs appear in similar locations in their ordered lists. This may increase accuracy of the scoring process.

Χ<Εΐίί3!!θ

[0045] In the example of Table 5, rules 130 and 132 and additional rules in the IT workflows 126 and 128 are shown in an ordered list. Between each of the rule pairs, third similarity scores (SS_BR1 to SS_BR7) may be determined by the third similarity score determiner 122. Third similarity scores of rule pairs within a threshold distance of the the rule pair 130 and 132 in the ordered lists may carry weight in the fourth similarity score determination for rules 130 and 132. In the example of Table 5, rule pairs no more than 2 pairs away from the rule pair 130 and 132 may be given weight in the fourth similarity score determination (i.e. 3 pairs away have no weight).

[0046] In some examples, the fourth similarity score between the rules 130 and 132 may comprise a sum of W2 multiplied by SS__BR2 plus W3 multiplied by SS_BR3 plus W4 multiplied by SS__BR4 plus W5 multiplied by SS__BR5 plus W6 multiplied by SS__BR6. Example values of the weights are shown in Table 5, and may sum to 1 . As shown, the third similarity score for the rule pair 130 and 132 themselves may carry the most weight, and progressively more distant rule pairs may carry lesser and lesser weight, until they carry none when sufficiently distant in the ordered list. In some examples, the weights may be predetermined or may be set by a user via the input device 138 of the similarity scoring system 101.

[0047] In some examples, a similar determination of a fourth similarity score may be made for any other rule pairs discussed earlier.

[0048] In some examples, the rule selector 125 may, through the output device 140 of the similarity scoring system 101 , provide a user interface indicating that a user has an option to select the rule 132 in the model IT workflow data 128 for usage by a user (rather than the rule 130 in the user-customized IT workflow data 126) in response to the fourth similarity score exceeds a threshold (e.g. a threshold of 0.75). Thus, the rule 132 may be caused to be selectable (e.g. by a user or automatically) to manage an IT environment. In some examples, the indication may take the form of a notification in the viewing area 142 of the output device 140. In some examples, the notification may be a textual notification. As shown in FIG. 4, the notification may include a linkage 148 between the depiction of rules 130 and 132 in the viewing area 142 indicating that the rule 132 may be used.

[0049] The user may then select, using the input device 138, to use the rule 132 when running the IT workflow, and cause the IT workflow to run. in some examples, the user may replace the user-customized IT workflow with the model IT workflow entirely (e.g. if a threshold number of multiple rule pairs exceed the threshold), and run the model IT workflow to manage the IT environment. The rule selector 125 may receive the input from the input device 138. in response to the fourth similarity score not exceeding the threshold, no indication to use the rule 132 may be made. In some examples, the threshold may be predetermined or may be set by a user via the input device 138 of the similarity scoring system 101.

[0050] FIG. 5 is a flow diagram illustrating a method 200 according to some examples. In some examples, the orderings shown may be varied, some elements may occur simultaneously, some elements may be added, and some elements may be omitted. In describing FIG. 5, reference will be made to elements described in FIG. 4. In examples, any of the elements described earlier relative to FIG. 4 may be implemented in the process shown in and described relative to FIG. 5. [0051] Αί 202, the IT workflow receiver 102 may receive IT workflow data 126 representing a user-customized IT workflow and IT workflow data 128 representing a model IT workflow. Any processes previously described as implemented by the IT workflow receiver 102 may be implemented at 202.

[0052] At 204, the rule processor 104 may process the rules for use by the score determiners 106, 1 14, 122, and 124. Any processes previously described as implemented by the rule processor 104 may be implemented at 204.

[0053] At 206, the first similarity score determiner 106 may determine a first similarity score between the rule 130 in the IT workflow data 126 and a corresponding rule 132 in the IT workflow data 128, using its DSL Levenshtein distance determiner 108 at 208, DSL Dice coefficient determiner 1 10 at 210, and score determiner 1 12 at 212. Any processes previously described as implemented by the first similarity score determiner 106, the DSL Levenshtein distance determiner 108, the DSL Dice coefficient determiner 1 10, and the score determiner 1 12 may be implemented at 206, 208, 210, and 212.

[0054] At 214, the second similarity score determiner 1 14 may determine a second similarity score between the rule 130 in the IT workflow data 126 and a corresponding rule 132 in the IT workflow data 128, using its string Levenshtein distance determiner 1 16 at 216, map and list Dice coefficient determiner 1 18 at 218, and score determiner 120 at 220, Any processes previously described as implemented by the second similarity score determiner 1 14, the string Levenshtein distance determiner 1 16, the map and list Dice coefficient determiner 1 18, and the score determiner 120 may be implemented at 214, 216, 218, and 220.

[0055] At 222, the third similarity score determiner 122 may determine a third similarity score between the rule 130 in the IT workflow data 126 and the rule 132 in the IT workflow data 128, based on the first similarity score determined by the score determiner 1 12 and the second similarity score determined by the score determiner 120. Any processes previously described as implemented by the third similarity score determiner 122 may be implemented at 222.

[0056] At 224, the fourth similarity score determiner 124 may determine a fourth similarity score between the rule 130 in the IT workflow data 126 and the rule 132 in the IT workflow data 128, based on a weighted average of third similarity scores of the rules pair 130 and 132 themselves and the third similarity scores of rule pairs sufficiently near the one of the rule pairs. Any processes previously described as implemented by the fourth similarity score determiner 124 may be implemented at 224.

[0057] At 226, the rule selector 125 may indicate that the rule 132 in the model IT workflow data 128 may be selected for usage by a user (rather than the rule 130 in the user-customized IT workflow data 126) in response to the fourth similarity score exceeding a threshold. Any processes previously described as implemented by the rule selector 125 may be implemented at 226.

[0058] Any of the processors discussed herein may comprise a microprocessor, a microcontroller, a programmable gate array, an application specific integrated circuit (ASIC), a computer processor, or the like. Any of the processors may, for example, include multiple cores on a chip, multiple cores across multiple chips, multiple cores across multiple devices, or combinations thereof. In some examples, any of the processors may include at least one integrated circuit (iC), other control logic, other electronic circuits, or combinations thereof. Any of the non-transitory computer-readable storage media described herein may include a single medium or multiple media. The non- transitory computer readable storage medium may comprise any electronic, magnetic, optical, or other physical storage device. For example, the non-transitory computer- readable storage medium may include, for example, random access memory (RAM), static memory, read only memory, an electrically erasable programmable read-only memory (EEPROM), a hard drive, an optical drive, a storage drive, a CD, a DVD, or the like.

[0059] Ail of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and/or all of the elements of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and/or elements are mutually exclusive.

[0060] In the foregoing description, numerous details are set forth to provide an understanding of the subject disclosed herein. However, examples may be practiced without some or all of these details. Other examples may include modifications and variations from the details discussed above. It is intended that the appended claims cover such modifications and variations.