METHOD OF DETECTING SERVICE INTERACTIONS IN INTELLIGENT NETWORKS

Abstract: The invention provides a method of detecting service interactions in intelligent networks. According to the invention, the detection method comprises a first stage in which services are formally specified and a second stage in which the thus specified services are checked for possible interactions. In the formal specification, use is made of conditions defining the execution of the services, such as pre-conditions, post-conditions and global conditions. The second stage is suitable for computer-assisted execution.

Description: Method of detecting service interactions in intelligent networks. BACKGROUND OF THE INVENTION The present invention relates to a method of detecting service interactions in intelligent networks. More specifically, the present invention relates to a method of providing a specification of services, and a method of detecting service interactions based on those specifications. In modern telecommunications networks, operators increasingly offer additional services to their customers. Examples of services are Originating Call Screening (OCS), Virtual Private Network (VPN), Follow On Call (FOC) and Language Selection (LGS). However, as the number of services increases, the likelihood of interactions between those services increases as well. In most cases, these interactions are unwanted, as they may occur unexpectedly and may produce undesired effects. Therefore, the occurrence of interactions of services should be detected and prevented, preferably in the design stage of the services. Prior art methods of detection of service interactions were primarily concerned with the comparison of textual descriptions of services. This known approach has the disadvantages of being inaccurate, as textual descriptions are often vague and ambiguous, and time-consuming, as numerous services specifications have to be compared by hand. Reference 1 ("A Practical Approach to Service Interactions") suggests using a more structured approach to the detection of service interactions, but does not offer a complete detection method which may be carried out by computer. Reference 8 ("A Verification Scheme for Service Specifications Described by Information Sequence Charts") proposes a method of detecting service interactions which may be carrieα out by computer. However, this known method is solely based on chronological mistakes and fails to detect all possible errors. SUMMARY OF THE INVENTION An object of the present invention is to provide a method of detecting service interactions which can be carried out, at least in part, by computer. A further object of the present invention is to provide a complete and reliable method of detecting service interactions. A still further object of the present invention is to provide a method of specifying services which provides unambiguous descriptions of services permitting the automatic processing of those descriptions for interaction detection purposes. According to the present invention, a method of detecting interactions of services in networks comprises a first stage in which formal specifications of services are produced and a second stage in which the formal specifications of the services are subjected to an interaction detection process, the formal specifications comprising conditions for each specific service and the interaction detection process comprising the verification of the conditions as affected by each service concerned. By using formal specifications, an exact and unambiguous description of the services, including their respective conditions, can be provided. By verifying the formally specified conditions, a process is provided which can easily be automated and which produces highly reliable results. REFERENCES [1] E. Kuisch et al.: "A Practical Approach to Service Interactions", IEEE Communications Magazine, August 1993, pp. 24-31. [2] An axiomatic basis for computer programming, Comm ACM 12 (October 1969), 576-580, 583. [3] ITU (CCITT) Recommendation Q.1211, Introduction to Intelligent Network for Capability Set 1. [4] ITU (CCITT) Recommendation Q.1214, Distributed Functional Plane for Capability Set 1. [5] ETSI draft ETR NA601-09, Service Life Cycle Reference Model, (July 1993). [6] European Patent Application 94200299.9. [7] ITU Recommendation Q.1204. [8] Okamoto et al.: "A Verification Scheme for Service Specifications Described by Information Sequence Charts", IEICE Transactions on Communications, Vol. E75-B, no. 10, pp. 978-985, Tokyo, October 1992. The above references are herewith incorporated in this text. BRIEF DESCRIPTION OF THE DRAWINGS The invention will now further be described by reference to the accompanying drawings, in which: Figure 1 schematically shows a Basic Call State Model as used in the method of the present invention; Figure 2 schematically shows a representation of additional services in relationship with the Basic Call State Model; Figure 3 schematically shows the applicable ranges of the conditions of an additional service (ASP); Figure 4 schematically shows the processing of a call; Figure 5 schematically shows possible interaction cases; Figure 6 schematically shows the applicable ranges of the conditions of a pair of additional services (ASPs). DETAILED DESCRIPTION OF THE INVENTION I. Call Modelling In this document, the term "ASP" will be understood to mean "Additional Service Processing", i.e. the processing or execution of a service additional to the Basic Call State Model (BCSM). More specifically, APSs will in general be understood to have been specified independently, i.e. it is assumed that ASPs are not designed to cooperate. The Basic Call State Model (BCSM) preferably used in the method of the present invention is depicted schematically in figure 1. This BCSM comprises a number of steps or stages each corresponding with states in a call. The BCSM of figure 1 combines the Originating BCSM and the Terminating BCSM of ITU Recommendation Q.1204, thus integrating the originating and termination call. The respective states (detection points) of the present BCSM, as rendered schematically in Figure 1, are: 1. Null (original or rest state) 2. Originating Attempt Authorized 3. Collect Info 4. Info Collected 5. Analyze Info 6. Info Analyzed 7. Routing 8. Route Select Failure 9. Terminating Attempt Authorized 10. Select Facilities & Present Call 11. T_Called_Party_Busy 12. O_Called_Party_Busy 13. Alerting 14. T No Answer 15. O No Answer 16. T Answer 17. O Answer 18. Active 19. O_Mid_Call 20. T_Mid_Call 21. O Disconnect 22. T Disconnect 23. O Exception 24. Abandon. It will be understood that in the above list, the prefix "O" refers to "Originating" (call or party) while "T" refers to "Terminating" (call or party). The BCSM of Figure 1 has the advantage that the numbers assigned to the detection points are suitable for time reference, as higher numbers refer to events later in time. This facilitates computerized operations. For further details of Basic Call State Models reference is made to [7]. In the method of the present invention, the influence of services, such as Intelligent Network (IN) services on the Basic Call State Model (BCSM) is described by (e.g. graphically) extending the BCSM with external states called the Additional Service Processing (ASP) states. That is, services are described as additional states of the BCSM. II. Specification of Services According to the present invention, services are formally described by means of conditions, such as pre conditions and post conditions. Pre and post conditions describe a function (e.g. an ASP) of a system (e.g. an intelligent network) in terms of states of the system. Pre and post conditions describe what the function is by defining the states prior to and after the execution of the function, rather than how the particular function is performed. A service model including pre and post conditions is depicted in Figure 2. Three ASPs (ASPl, ASP2 and ASP3) interact with the BSCM, the interactions being schematically rendered by arrows between the BCSM and the ASPs. These arrows, as used in Figure 2, schematically depict the points in time (detection points) when the execution of the BCSM is interrupted in order to execute an ASP, that is, where the BCSM is exited and where it is returned to (see also Figure 1). Before and after the execution of each ASP, certain pre and post conditions hold. For example, before the execution of ASPl the pre condition Prel holds in the BCSM. After the execution of ASPl, post condition Postl holds. Thus, the behaviour of ASPl is defined, at least in part, by the conditions Prel and Postl. Similarly, conditions Pre2 and Post2 are associated with ASP2, and conditions Pre3 and Post3 are associated with ASP3. In addition to pre and post conditions, the following conditions are identified: global conditions (proper), holding during the entire call; global pre conditions, holding until the moment of execution of an ASP; global post conditions, holding after the end of an ASP until the end of a call. The time relationships of the various conditions are depicted in Figure 3. Global conditions hold before, during and after the execution of the ASP concerned. It will be understood that, for a particular ASP, only those global conditions have to be taken into consideration which affect the ASP or which may be affected by the ASP in question. Global preconditions (denoted "PreGlobal" in Figure 3) hold until the execution of the ASP, global postconditions (denoted "PostGlobal" in Figure 3) hold after the execution of the ASP. Pre and post conditions (denoted "Pre" and "Post" in Figure 3) hold at the beginning and at the end of the execution of the ASP respectively, a pre condition being a prerequisite for the ASP to be executed and a post condition being established by the execution of the ASP. (Note that for the sake of clarity, in Figure 3 exit and return are not indicated by arrows as in Figure 2). The behaviour of an ASP can, in accordance with the present invention, be expressed as: {global coi. " ΏOΏ} {global pre edition ASP} {pre condition ASP} ASP {post condition ASP} {global post condition ASP} In addition to conditions, different types of data pertinent to the ASP can be identified: BCSM Data, BCSM State Information, Service Data, and User Interaction Data. BCSM Data are data used by the BCSM, e.g. Calling- Party Number and CalledPartyNumber. BCSM Data are transferred between the BCSM and the ASPs. BCSM State Information refers to the states of the BCSM. This information is exchanged between the BCSM and an ASP at the beginning and at the end of the execution of an ASP. Service Data are specific data for a particular service, e.g. a personal number. Service Data are not exchanged between BCSM and ASPs. User Interaction Data pertain to the communication of the service with end users. It comprises announcements to the users and collected information (Collectedlnfo) from the users. User Interaction Data are exchanged between the BCSM and ASPs. The above data types together constitute the data environment of a service. An attribute is constituted by data common to all processes concerned. In the present case an attribute is data known to both the BCSM and an ASP, and used to influence each other's behaviour. The prime importance of attributes lies in the unambiguous assignment of names to different (types of) data. Attributes can either be BCSM Data (e.g. CallingPartyNumber, CalledPartyNumber), BCSM State Information (e.g. Exit, Return, ReturnState, EDP Set) or User Interaction Data (e.g. Announcements, Collectedlnfo). III. Detection Method The detection method of the present invention comprises the pairwise comparison of features at specification time. ASPs which are specified as set out above can easily be compared and checked for interaction. It is assumed that the ASPs are conjunct, the ASPs to be checked each have only one return. Furthermore, it is assumed that of each pair of ASPs to be checked, the first ASP (ASPl) exits before the second ASP (ASP2) exits. In other words, ASPl leaves the BCSM at an earlier stage than ASP2. This will be written symbolically as: exitl < exit2, the mark "<" meaning "earlier in time". In case ASP2 exits before ASPl (exitl > exit2, the mark ">" meaning "later in time", and, in the BCSM of Figure 1, also meaning a higher detection point reference number), the AS - should be interchang ..- to meet the above assumption. In case the ASPs exit at the same time (exitl = exit2, the mark "=" meaning "at the same point in time"), the detection method should be applied twice, interchanging ASPl and ASP2 after the first time. In Figure 5, exits and returns are schematically depicted, exits being denoted by arrows pointing from the BSCM towards the ASPs and returns being denoted by arrows pointing from the ASPs towards the BCSM. Reference numerals 1, 2, 3 and 4 respectively refer to four consecutive (detection) points in the BCSM. It should be noted that the magnitude of said reference numerals have no bearing on the detection points in Figure 1. In Figure 5a, ASPl exits (1) and returns (2) before ASP2 exits (3): exitl < exit2 and returnl < exit2. In Figure 5b, exitl < exit2 but returnl > exit2: returnl is associated with point 3, while exit2 is associated with point 2. In Figure 5c, exitl = exit2 (point 1). In the case of Figure 5c interaction of the two ASPs may be expected. It is noted that the term C-BCSM (Centralised BCSM) used in Figure 5 refers to the BCSM of Figure 1, that is, the centralised call model in which O- BCSM and T BCSM are combined (see also Reference 4). As stated above, the method of the present invention has as preliminary steps (i) dissecting ASPs in conjunctive parts and (ii) comparing exit and return information of pairs of ASPs, denoting the ASP with the earliest exit (the smallest exit state, i.e. the detection point having the lowest number, in the BCSM of Figure 1) ASPl and denoting the other one ASP2. Subsequently, the following steps may be performed in order to detect potential interactions of the ASPs: 1. If return l>exit2 go to step 5. 2. If ASPl maintains an existing control relationship go to step 5. 3. If (return2>exitl) or (exitl=exit2 and return2≥exit2): Verify {Prel} CallProcessing(exitl,exit2) {Pre2} and Verify {Postl and PostGlobal 1 and Global 1} CallProcessing(return2, exitl) {Pre2} 3.1. If one of either statements is true and one is false then "Interaction because of conflict of control" (ASPl influences control of ASP2). Go to step 6. 3.2. If both statements are true then: Verify {PreGlobal2 and Global 1 and Prel} ASPl {PreGlobal2 and Global2 and Postl} and Verify {PostGlobal 1 and Global 1 and Pre2} ASP2 {PostGlobal 1 and Global 1 and Post2}. 3.2.1. If (only) one of both statements is false then "Interaction". 3.2.2 Go to step 6. 4. If (return2≤exitl) and (exitl ≠exit2 or return2<exit2): Verify {Post2 and Global2 and PostGlobal2 and PreGlobal2} CallProcessing(return2,exitl ) {Prel} 4.1 If false and repeated execution of ASPl is desired then "Interaction" (ASPl should be executed but will not). 4.2 If true and repeated execution of ASPl is not desired then "Interaction" (because of undesired re-execution). 4.3 Go to step 6. 5. Verify: {Prel} CallProcessing(exitl, exit2) {Pre2} If true: "Interaction" (because of conflict of control). 6. If the ASPs can occur in a call involving three parties then 6.1 If both ASPs operate on terminating parties then verify: {PostGlobal 1 and Global 1 and Pre2} ASP2 {PostGlobal 1 and Global 1 and Post2} and {PreGlobal2 and Global2 and Prel} ASPl {PreGlobal2 and Global2 and Postl} 6.2 If false then "Interaction" (because of conflict in conditions). 7. If the ASPs occur in independent sessions then verify: {PostGlobal 1 and Global 1 and Pre2} ASP2 {PostGlobal 1 and Global 1 and Post2} {PreGlobal2 and Global2 and Prel} ASPl {PreGlobal2 and Global2 and Postl} and {PostGlobal2 and Global2 and Prel} ASPl {PostGlobal2 and Global2 and Postl} {PreGloball and Global 1 and Pre2} ASP2 {PreGloball and Global 1 and Post2} 7.1 If false then "Interaction" (because of conflict in conditions). If other conjunctive ASP combinations have to be considered then return to step 1. The control relationships mentioned above can be identified by means >{ the BCSM State Information EDP Set (comprising DetectionPointNumber and RelationshipID). With the above method, interactions can readily be detected, either manually or computer-assisted, and a network free of interactions can be realized. The verification rules of the method of the present invention accordingly have the format {P} S {Q}, where P and Q are conditions and S is a process (ASP). In a verification rule: - if P does not hold: conclude FALSE. - if P holds and {P} S {Q} holds: conclude TRUE. - if P holds and {P} S {Q} does not hold: conclude FALSE. The process S can also be denoted by CallProcessing(x,y), as depicted in Figure 4, representing the transition from a state x to a state y in the BCSM. State x may, for example, be exitl, while state y may be exit2. As stated above, the method of the invention applies logical verification rules to formal specification rules in order to detect potential interaction cases. IV. Examples In the examples, the sign Λ means "logical AND", while the sign V means "logical OR". The sign -> means "logical NOT". The sign Φ indicates concatenation. To indicate that some data exist and have a non-specific value ("don't care") the notation <datanameO> is used, e.g. CalledPartyNumberO (here the enclosing signs < and > are used to specify a data example). To indicate that some data are not available (and have no value), the 'value' NILL is used. The function "Screen" evaluates a logical statement, i.e. checks occurrences. E.g. Screen(<Value list>, <Column list>, <Table name>) provides the boolean result of the question whether in the columns <Columns list> of table <Table name> the values <Value list> are available. Comments in the specifications of the examples are given between /* and */. Example 1. The following example will show the application of the method for deriving pre and post conditions from a textual description in ten steps. The example will use the Originating Call Screening service (OCS): "Originating calls may be controlled by the Originating Call Screening capability. This allows the subscriber to specify that outgoing calls be either restricted or allowed, according to a screening list and, optionally, by time of day control. This can be overridden on a per-call basis by anyone with the proper identity code." [3] The OCS service used here will contain a list of numbers that are not allowed; besides, for reasons of simplicity, the passing of the screening by using identity codes will not be taken into account. Following the method of the present invention, the following steps are taken: Siep 1 requires to identify a database structure for OCS; since OCS is expected to be active, we abstract from the data used to indicate the OCS activation status. The foil: wing database structure will be used: OCS-table: CallingParty & CalledParty with key: (CallingParty,CalledParty) and the data type of CallingParty and CalledParty being resp. CallingParty Number and CalledParty Number. The interpretation of this table is: the occurrence of (CallingParty, C iledParty) in OCS-table means that a call from CallingParty (originating side) to CalledParty (terminating side) is not allowed. Because of this interpretation both columns in such a table should be marked: the column CallingParty is related to the attribute CallingPartyNumb-: and CalledParty to CalledParty Number. It should be noted that the BCSM data CallingParty Number, indicating the location of the originating party, and CalledPartyNumber, indicating the dialled digits or the location of the terminating party, are data of the type: list of E.164 type (also see the international data standard E.164, herewith incorporated by reference in this text). In step 2 (defining a global expression in term of the goal of the service), the expression of the goal is: when a call is active, the Calling- PartyNumber and CalledPartyNumber will not occur as a row in the OCS-table. Or using attributes (using BCSM State to indicate the state of the BCSM): -- (BCSM_State = Active Λ Screen((Last(CallingParty Number), Last(CalledPartyNumber)), (CallingParty, CalledParty), OCS-table) = TRUE) Step 3 (stepping through the detection points in the BCSM and identifying the actions to be performed) leads to the conclusion that Info Analysed is the proper detection point (6 in Figure 1) to start the only OCS-ASP. Stepping through the ASPs for OCS is restricted to one ASP. Step 4 (determining a trigger condition for the ASP and using this as the first part of a pre condition) leads to the following pre condition: {/* trigger criteria */ Exit = 6 Λ /* other attributes */ CallingPartyNumber = CallingPartyNumberO Λ CalledPartyNumber = CalledPartyNumberO Λ EDP_SET = EDP_SetO Λ Announcements = AnnouncementsO Λ Collectedlnfo = CollectedlnfoO } , where EDP SET is the set of (exit) detection points concerned. In step 5 (characterising the ASP in general terms) the goal of the ASP is determined: check whether a call is allowed or not. The following cases can be identified. For OCS those cases are related to the possible paths after the screening has been performed; three cases are possible: * ■ the pair (Last(CallingPartyNumberO), Last(CalledPartyNumberO)) is not found in OCS-table; this means that the call is allowed; ► the pair (Last(CallingPartyNumberO), Last(CalledPartyNumberO)) is found in OCS-table; this means that the call is not allowed; ► something went wrong during the execution of the ASP. Step 6 (stepping through all attributes and determining whether they will be used in the ASP) leads to the following attributes: ► CallingParty Number and CalledPartyNumber (mentioned in step 1 ) ► Announcements (because of the need to inform a user when something goes wrong or when the call is not passed) ► Exit and Return (used to indicate the begin resp. end of the ASP) Step 7 (for each attribute found in step 6 and used as input, determine its use, per case as in step 5, in operations on the database structure): it is possible to write the cases (step 5) in the following format, being the base for the post condition: { (/* the call is allowed */ Screen((Last(CallingPartyNumberO), Last(CalledPartyNumberO)), (CallingParty, CalledParty), OCS-table) = FALSE) ....) V (/* the call is not allowed */ Screen((Last(CallingPartyNumberO), Last(CalledPartyNumberO)), (CallingParty, CalledParty), OCS-table) = TRUE) ) V (/* something went wrong */ SLE Error ....) } It is noted that SLE Error is a variable expressing that some error has occurred during the execution of the service logic (e.g. operations on non- existing databases) due to which the call is cleared. In step 8 (determine per case, as in step 5, the value of each attribute used as output in terms of the database structure of step 1 and the operations of step 7, and write those operations in the post condition, separated by logical ORs) the post condition is extended: in the case in which the call is allowed, nothing is changed except the Return; in the case in which the call is not allowed and in the case where something went wrong the CallingParty Number is assigned to NILL and Announcement is changed. This yields: { (/* the call is allowed */ Screen((Last(CallingPartyNumberO),Last(CalledPartyNumberO)), (CallingParty, CalledParty), OCS-table) = FALSE) Λ Return= 6....) V (/* the call is not allowed */ Screen((Last(CallingPartyNumberO),Last(CalledPartyNumberO),) (CallingParty, CalledParty), OCS-table) = TRUE) Λ Return= 1 Λ CalledPartyNumber = CalledPartyNumberO ® NILL Λ Announcements = AnnouncementsO Φ "it is not allowed to call this number" ) V (/* something went wrong */ SLE Error Λ Return= 1 Λ CalledPartyNumber = CalledPartyNumberO © NILL Λ Announcements = AnnouncementsO Φ "Sorry, something went wrong"....) } Step 9 (check if all attributes mentioned in the pre condition occur in at least one of the cases of the post condition, remove non-occurring expressions) leads to the removal of EDP SET and Collectedlnfo from the pre condition: {/* trigger criteria */ Exit = 6 Λ /* other attributes */ CallingPartyNumber = CallingPartyNumberO Λ CalledPartyNumber = CalledPartyNumberO Λ Announcements = AnnouncementsO} Step 10 (check if each attribute mentioned in the pre condition occurs in all cases of the post condition, if not, add where the attribute is missing an expression to assign the initial value or NILL [empty] to the attribute) results in the following post condition: { (/* the call is allowed */ Screen((Last(CallingPartyNumberO), Last(CalledPartyNumberO)), (CallingParty, CalledParty), OCS-table) = FALSE) Λ Return = 6 Λ Announcements= AnnouncementsO Λ CallingParty Number = CallingParty NumberO Λ CalledPartyNumber = CalledPartyNumberO) V (/* the call is not allowed */ Screen((Last(CallingParty NumberO), Last(CalledParty NumberO)), (CallingParty, CalledParty), OCS-table) = TRUE) Λ Return= 1 Λ CalledPartyNumber = CalledPartyNumberO Φ NILL Λ CallingParty Number = CallingParty NumberO Λ Announcements = AnnouncementsO Φ "it is not allowed to call this number") V (/* something went wrong */ SLE Error Λ Return= 1 Λ CalledPartyNumber = CalledPartyNumberO © NILL Λ CallingParty Number = CallingParty NumberO Λ Announcements = AnnouncementsO Λ "Sorry, something went wrong") } In step 11 (checking if there is a part of the post condition that should hold during several states of the BCSM and stating it as global post condition; and checking if there is a part of the pre condition that should hold during several states of the BCSM and stating it as global pre condition) it is concluded that the CalledPartyNumber, if it is an ordinary telephone number, may not be changed after this check. So the expressions assigning a value to CalledPartyNumber should be regarded as global conditions. This finalises the derivation of pre and post conditions for OCS: { /*trigger criteria*/ Exit=6 Λ /*other attributes*/ CallingParty Number = CallingParty NumberO Λ CalledPartyNymber=CalledPartyNumberO Λ Announcements = AnnouncementsO } OCS { ( /*the call is allowed*/ Screen ((Last(CallingPartyNumberO), Last(CalledPartyNumberO)), (CallingParty, CalledParty),OCS-table)= FALSE) Λ Return=6 Λ A n n o u n c e m e n t s = A n n o u n c e m e n t s O Λ CallingPartyNumber = CalledPartyNumberO Λ CalledPartyNumber=CalledPartyNumberO) V (/*the call is not allowed*/ Screen((Last(CallingPartyNumberO), Last(CalledPartyNumberO)), (CallingParty, CalledParty),OCS-table)= TRUE) Λ Return=l Λ CalledPartyNumber=CalledPartyNumberO © NILL Λ CallingPartyNumber=CallingPartyNumberO Λ Announcements=AnnouncementsO © "it is not allowed to call this number") V (/*something went wrong*/ SLE Error Λ Return=l Λ CalledParty Number=CalledParty NumberO © NILL Λ CallingPartyNumber=CallingPartyNumberO Λ Announcements=AnnouncementsO © "Sorry, something went wrong") } { /*global post condition*/ - Class(CalledPartyNumber) = OrdinaryTelephoneNumber Λ CalledPartyNumber ≠ CalledPartyNumberO Λ CalledPartyNumber ≠ (CalledPartyNumberO © NILL)) } Taking into account the global condition and the result of the screening, due to the OCS ASP, one can easily see that the global condition, stated in step 2, is reflected by the global post condition above if the BCSM is in the Active state. Example 2. In this example a simple specification for Outgoing Call Screening (OCS), using a "black list" of unaccessible numbers, and Abbreviated Dialling (ABD) will be used. CPN (and cpn) will be used as abbreviation for called party number. OCS_T : OCSList { exit = 4 Λ cpn = CPN1} OCS { (Screen(cpn, OCS_T) = False Λ cpn = CPN1 Λ return = 4) V (Screen(cpn, OCS_T) = True Λ cpn = CPN1 Λ return =1) } {PostGlobal: cpn=CPNl} The conditions make use of the specification variable (with constant, but unknown, value) CPNl. Hence the global post condition, which has to be maintained by every other ASP states so that the called party number may not be changed. In this example the following dissected case will be used: Post: ((Screen(cpn, OCS__T) = False Λ cpn = CPNl Λ return = 4) ABD__T : ABDNr & TransNr { exit = 4 (Collected_Info) Λ cpn = CPNO } ABD { return = 4 (Collected Info) Λ cpn = translate(CPN0, ABDNr, ABD_T) } When looking at the profile it can be concluded that for detection purposes two cases (because exit OCS=exit ABD) should be considered: [ABD; OCS] and [OCS; ABD]. For this example only [OCS; ABD] will be investigated. The rule to be verified first is: {Postl} CallProcessing(return2, exitl) {Pre2}, which in this example looks like: { (Screen(cpn, OCS_T) = False Λ cpn = CPNl ) } CallProcessing(4,4) { cpn = CPNO } This is only true when CPN1=CPN0, but since CPNl and CPNO are specification variables CPN0=CPN1 will hold. The case CPN0=CPN1 obliges us to verify the rules with the global conditions, in this case one of them (the second) looks like: { cpn=CPNl and cρn=CPN0 } ABD { cpn=CPNl and cpn = translate(CPNO, ABDNr, ABD__T) } Since CPN0=CPN1 and translate(CPNO, ABDNr, ABD_T) will definitely result in a value which differs from CPNO, this global condition is violated: interaction detected for this case, i.e. interaction is possible for the combination ABD and OCS. Note that when no global condition is used in this case, no interaction can be detected. Example 3. Origin Dependent Routing (ODR) and Time Dependent Routing (TDR) will be used in this example. Both are considered as originating features. ODR_T : CalledPartyNumber & CallingPartyNr & TransNr { exit = 4 Λ cpn[1..2]= "88" Λ cpn = CPNO Λ CallingPartyNr = Calling- PartyNrO } ODR { return = 7 (routing) Λ cpn = translate({CPNO, CallingPartyNrO}, {CalledPartyNumber, CallingPartyNr}, ODR_T) } TDR_T : CalledPartyNumber & Time & TransNr { exit = 4 Λ cpn[1..2] = "89" Λ cpn = CPNl } TDR {return = 7 Λ cpn = translate({CPNl, system time}, {CalledPartyNumber, Time}, TDR_T) } Since exit ODR and exit TDR are identical, two cases have to considered. In this example only [ODR; TDR] will be considered. Because return ODR > exit TDR, there is a possible conflict of control and the following verification rule needs to be checked: {Prel} CallProcessing(exitl,exit2) {Pre2} I.e: { cpn[1..2]= "88" Λ cpn = CPNO Λ CallingPartyNr = CallingPartyNrO} CallProcessing(4,4) { cpn[1..2] = "89" Λ cpn = CPNl } Since CallProcessing(4,4) equals doing nothing, the value of cρn[1..2] will not change, hence this rule does not hold. Therefore, interaction does not occur. This example is rather illustrative for the often simple application of the method of the invention. It will be understood by those skilled in the art that the above examples are for illustration purposes only and that various modifications and additions can be made without departing from the spirit and the scope of the present invention.

Claims: CLAIMS 1. Method of detecting interactions of services in networks, comprising a first stage in which formal specifications of services are produced and a second stage in which the formal specifications of the services are subjected to an interaction detection process, the formal specifications comprising conditions for each specific service and the interaction detection process comprising the verification of the conditions as affected by each service concerned. 2. Method according to claim 1, wherein the conditions relative to the execution of a service are chosen from a group consisting of pre conditions holding at the start of the execution, post conditions holding at the end of the execution, global conditions holding before, during and after the execution, pre global conditions holding until the execution and post global conditions holding after the execution. 3. Method according to claim 1 or 2, wherein the interaction detection process utilizes verification rules of the format {P} S {Q}, P being a first condition relating to the execution of a service, S being the execution of the service, and Q being a second condition relating to the execution of the service, interaction being present if either P does not hold or P holds while {P} S {Q} does not hold. 4. Method of producing service specifications for use in the method of any of the preceding claims, comprising the steps of: a. Defining a database structure for data specific to the service (service data); b. Defining a global condition in terms of the goal of the service, service data, and data (attributes) exchanged between the service and a Basic Call State Model (BCSM); c. Stepping through all detection points in the Basic Call State Model, identifying for each detection point the activities to be perfor¬ med, marking the detection points for which interruption of the BCSM is necessary, identifying those detection points with additional service processes (ASPs), and repeating for each ASP: d. Determining a trigger condition for the ASP and writing this condition as the first part of a pre condition, adding for every attribute not mentioned an expression to indicate the attribute has a 'don't care' value; e. Characterising the ASP in general terms, stating what the ASP is expected to do and which cases can be recognised; f. Stepping through all attributes and identifing whether they will be used in the ASP (as input or as output); g. For each attribute used as input, found in the previous step, determining per case (step e) its usage in operations on the database structure found in step a; h. Determining per case (step e) the value of each attribute, used as output, in terms of the database structure of step 1 and the operations of step g, writing those expressions in the post condition, e.g. separated by V (conjunctive parts); i. Checking if all attributes mentioned in the pre condition occur in at least one of the cases of the post condition; if not, removing the expression concerning the attribute from the pre condition; j. Checking if each attribute mentioned in the pre condition occurs in all cases of the post condition; if not, adding to the case where the attribute is missing an expression (e.g. separated by Λ) to assign the initial value to the attribute, or, if an attribute should have a new value after execution of an ASP according to its goal, but did not get a new value because of faults or failures, to assign the value NILL to the attribute; k. Checking if there is a part of the post condition that should hold for a longer period (during several states of the BCSM), separating this part, and stating it as a global post condition; 1. Checking if there is a part of the pre condition that should hold for a longer period (during several states of the BCSM), separating this part, and stating it as a global pre condition. 5. Process of detecting service interactions for use in the method of any of the claims 1, 2 or 3, comprising the steps of: a. Identifying the data (attributes) exchanged between the service and a Basic Call State Model (BCSM) and used by each additional service process (ASP). If the intersection of two sets of attributes is empty then conclude: no conflict, else go to step b. b. Checking if two ASPs are mutually exclusive, i.e. if their conditions for execution are contradictory. If true then conclude: no conflict, else go to step c. c. Checking whether the post condition of an ASP executed first implies the pre condition of the ASP executed second. If not true then conclude: conflict, else go to step d. d. Checking whether the conditions which should hold for the entire call in which the ASPs occur are violated. If true conclude: conflict, else go to step e. e. Verifying if the condition which has to be maintained after the processing of the first ASP is invariant while executing the second ASP, and verifying whether the post global condition of the first ASP and the global condition of the second ASP, the post global condition of the first ASP and the pre global condition of the second ASP, and the post global condition of the first ASP and the post global condition of the second ASP are conflicting. If violated conclude: conflict, else go to step f . f. Verifying if the condition which has to be maintained until the processing of the second ASP is invariant while executing the first ASP, and verifying whether the pre global condition of the second ASP and the pre global condition of the first ASP, the post global condition of the first ASP and the pre global condition of the second ASP, and the global condition of the first ASP and the pre global condition of the second ASP are conflicting. If violated conclude: conflict, else go to step g. g. Concluding, if this step is reached, that no conflict occurs. 6. Interaction detection system, comprising a computer programmed to detect service interactions according to the method of any of the preceding claims.

Inventors: JANMAAT RONALDUS GERARDUS JOHA, KUISCH ERIC BRYAN, MELISSE ALFONSIUS ANTONIUS JOH, SIPS JOHAN WILLEM, JANMAAT, RONALDUS, GERARDUS, JOHANNES, KUISCH, ERIC, BRYAN, MELISSE, ALFONSIUS, ANTONIUS, JOHANNES, SIPS, JOHAN, WILLEM
Applicants: JANMAAT RONALDUS GERARDUS JOHA, KUISCH ERIC BRYAN, MELISSE ALFONSIUS ANTONIUS JOH, NEDERLAND PTT, SIPS JOHAN WILLEM, JANMAAT, RONALDUS, GERARDUS, JOHANNES, KONINKLIJKE PTT NEDERLAND N.V., KUISCH, ERIC, BRYAN, MELISSE, ALFONSIUS, ANTONIUS, JOHANNES, SIPS, JOHAN, WILLEM
Application year: 1995
Main classification: H04Q3
IPC codes: H04M3, H04Q3