Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F8/00—Arrangements for software engineering
  • G06F8/10—Requirements analysis; Specification techniques

Definitions

• the present invention relates to an automated development method with updating.
• a design level can, for example, be expressed as UML models
• Fig 1 First development.
• the first level of design is called "Problem specification”. It is at this level that the customer defines his need: each aircraft is characterized by a name (A3XX), a number of passengers (600) and a number of engines (4). 2.
• the level “Analysis of the problem” is carried out in UML.
• This analysis step is still very much linked to the field of the trade concerned. At the end of this stage, we can still see the concepts of "airplane”, “passenger”, and "engine” (this information is noted in quotes. These are the significant objects of the level of design considered).
• This analysis step also reveals new information such as the reservation, the name and the nationality of the passengers. This information refines concepts of the previous design level; they cannot be deducted automatically: these are the designer's choice of design.
• reaction iii. a stereotypical “passenger” class with the name “person”.
• b. create a relationship (UML composition link) named “motorization” between the stereotypical class “airplane” and the stereotypical class “engine” with as cardinalities (number / digit) a class side stereotypical “airplane”, value of number of engines class side stereotypical “engine”.
• vs. create an association link named "passenger” between the stereotypical class "airplane” and the stereotypical class "passenger” with cardinalities as an airplane side, value of number of passengers on the stereotypical class side "passenger”.
• R 3 For any class stereotyped “airplane” at the “problem analysis” level, the algorithm consists of: a. create a class without stereotype at the level “design of a solution” having the same name as the name of the stereotyped class “airplane” at the level of design “analysis of the problem”; b. create an inheritance relationship from the newly created class to the stereotypical "Active”class; A: For any stereotypical "passenger” class at the "problem analysis” level, the algorithm consists of: a. create a class without stereotype at the level “design of a solution” having the same name as the name of the stereotyped class “passenger” at the level of design “analysis of the problem”; b. create an inheritance relationship from the newly created class to the stereotypical "Active”class;
• R 5 For any stereotyped class “engine” at the “problem analysis” level, the algorithm consists of: a. create a class without stereotype at the level “design of a solution” having the same name as the name of the stereotyped class “engine” of the level of design “analysis of the problem”; b. create an inheritance relationship from the newly created class to the stereotypical "Active"class;
• the algorithm For any non-stereotyped class at the “problem analysis” level, the algorithm consists of: a. create a class without stereotype at the level of “design of a solution” having the same name as the name of the class of the level of design “analysis of the problem”; A: For any association linking two classes A and B at the “problem analysis” level, the algorithm consists of: a. create an association at the "design of a solution” level linking the classes from A and B by the transformation algorithm. The cardinalities (the numbers) and the role (the name) are identical to those of the design level "analysis of the problem”; R 8 : For any operation of a class A at the “problem analysis” level, the algorithm consists of: a. create an operation at the “design of a solution” level having the same name as the name of the operation at the “analysis of the problem” design level; b. associate this operation with the class from A by the transformation algorithm.
• R g For any attribute of a class A at the “problem analysis” level, the algorithm consists of: a. create an attribute at the “design of a solution” level having the same name as the name of the operation at the “analysis of the problem” design level; vs. associate this attribute to the class from A by the transformation algorithm. Designing a complex system, as outlined briefly above, involves several design steps and may require many iterations. At each iteration, the designer questions his choices. He makes modifications to improve his models. However, the transformation rules mechanism does not take this aspect into account.
• the modifications are taken into account from the construction point of view for the reconstruction of a level N + 1 from the level N, but there is no integration of the modifications with the information already existing at a level N + 1 previously created and completed manually. All information that had been entered manually is lost when the rules are re-applied.
• the problem is to go automatically or semi-automatically from a design level N to a level N + 1 (or more generally from one model to another) with the following constraints: • keep the information added at the level below - N + 1 overlay when re-applying the rules; • keep and explain all the information used during the application of the rules so as to be able to reproduce the process (this information will be called rule parameters). Saving them allows the rules to be re-applied without further interaction with the designer.
• the present invention relates to an automated development process coupling traceability and transformation.
• the method according to the invention is an automated development method with transformation rules making it possible to go from one model to another, with updating, and it is characterized by the fact that each model element is associated automatically produces at least one traceability link with all of the elements from which it originates according to the transformation rule.
• the elements used are UML elements.
• a UML "dependency" is used to establish the traceability link, the "dependency" being as defined at OMG in the definition of the UML language.
• FIG. 1, cited above, is a block diagram of a first development of an air traffic simulation program
• FIG. 2 is a block diagram resulting from that of FIG. 1, as obtained after a non-conservative transformation, according to the prior art
• FIG. 3 is a block diagram resulting from that of FIG. 1, as obtained after a conservative transformation, according to the method of the invention,
• FIG. 4 is a block diagram illustrating the automatic construction of the level of analysis according to the method of the invention (the dotted lines represent the traceability link which has been created),
• FIG. 5 is a block diagram illustrating the manual enrichment of the level of analysis by the designer (information in italics and in thin lines).
• FIG. 6 is a block diagram illustrating the second iteration of the algorithm for implementing the method of the invention.
• the designer modified the specification of the problem by changing the name of the aircraft and then re-applied the rules to update his model.
• the invention proposes to associate with the transformation rules elements of traceability.
• the application of the transformation rules alone ensures only an ephemeral traceability link between elements of a source design level and the corresponding elements of the target design level.
• the invention proposes to couple a traceability mechanism with a transformation mechanism. For this, we add elements to the rules which:
• the transformation-conservative mechanism of the invention makes it possible to maintain consistency in design levels by applying rules coupled with elements of traceability. With this mechanism, it is possible to rename PA3XX to A380 and to automatically pass on this modification to all of the underlying levels without losing the information added manually (Cf. Fig 3: Conservative transformation).
• the conservative transformation mechanism supports incremental and iterative development. It also supports endomorphic transformations (within a single design level). This mechanism can also be used to propagate marks used to delete elements via rules similar to those in the example.
• the invention proposes a traceability mechanism coupled with the transformation rules, making it possible to make the link between the elements produced by the transformation and the elements from which they originate, as well as the information called parameters of the transformation rule.
• this link traceability link. It is a logical link, which links n source elements, to m target elements. Definitions:
• Link S, C, R the traceability element between S, and C which can be associated with specific parameters (PARAM s, R) to the application of R on S.
• PARAM s, R specific parameters
• the set C is obtained by following the Link s ⁇ from S. For any element of C, we assign the values calculated from S, R and possibly PARAMs ⁇ .
• the first phase is the creation of the analysis model by a first iteration of the algorithm (Cf: Figure 4)
• A3XX a stereotyped “project” directory bearing the name of the aircraft in the description (ie A3XX) comprising: i. a stereotypical “airplane” class called A3XX, ii. a stereotypical “engine” class with the name “reaction”, iii. a stereotypical “passenger” class with the name “person”.
• b. create a composition link called “motorization” between the stereotyped class “airplane” and the stereotyped class “engine” with a cardinality 1 side class stereotyped “plane”, and 4 side class stereotyped “engine”.
• vs. create an association link named "passenger” between the stereotypical class "plane” and the stereotypical class "passenger” with a cardinality 1 class side stereotyped "plane”, 600 class side stereotyped "passenger”.

Landscapes

• Engineering & Computer Science (AREA)
• General Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Software Systems (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Stored Programmes (AREA)
• Feedback Control In General (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Devices For Executing Special Programs (AREA)

Applications Claiming Priority (3)

Publications (1)

Family

ID=32865188

Family Applications (1)

Country Status (6)

Families Citing this family (3)

Family Cites Families (1)

• 2003
  • 2003-03-03 FR FR0302558A patent/FR2852117A1/fr not_active Withdrawn
• 2004
  • 2004-02-18 WO PCT/EP2004/050151 patent/WO2004079477A2/fr not_active Ceased
  • 2004-02-18 CA CA002517775A patent/CA2517775A1/en not_active Abandoned
  • 2004-02-18 US US10/546,649 patent/US20060248502A1/en not_active Abandoned
  • 2004-02-18 CN CN200480005967.3A patent/CN1757013A/zh active Pending
  • 2004-02-18 EP EP04712052A patent/EP1599795A2/de not_active Withdrawn

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events