| Studiju veids |
maģistra akadēmiskās studijas |
| Studiju programmas nosaukums |
Datorsistēmas |
| Nosaukums |
UML stāvokļu diagrammas izvietošanas algoritma izstrāde |
| Nosaukums angļu valodā |
Algorithm Development for UML Statechart Layout |
| Struktūrvienība |
12300 Lietišķo datorsistēmu institūts |
| Darba vadītājs |
Oksana Ņikiforova |
| Recenzents |
Katrina Boločko |
| Anotācija |
UML STATE CHART DIAGRAM, LAYOUT ALGORITHM, GRAPH THEORY, MODEL TRANSFORMATION.
Software modelling relies heavily on Unified Modelling Language (UML) State Chart Diagrams because they provide a standardized notation for representing the state of a system and the transitions between these states over time. State Charts are the most used diagrams in the Module-Driven Drawings (MDD) of the Unified Modelling Language (UML). There are several software tools available which aid in preparing the layout of State Chart diagrams. While these tools perform well with static diagrams, their efficacy diminishes when modifications to the diagrams are required and as the complexity of the layouts increases. In such cases, the diagrams laid out by these tools either become cluttered, difficult to understand, not so pleasing to the humans’ eyes and, sometimes, outright inaccurate.
In this thesis, the challenges inherent in UML State Diagram layout are examined and emphasize the importance of layout in improving both their readability and practical utility. The investigation focuses on how automatic layout methods are currently employed in this domain. The primary goals of this thesis include gaining a comprehensive understanding of how automated layout algorithms are integrated into UML modelling tools, identify the unique challenges and restrictions encountered in UML State chart Layout, and quantify the extent to which automatic layout generation improves productivity.
This thesis attempted to explore some of the widely used existing algorithms upon which modelling software tools are based. A few of the algorithms revisited are orthogonal graphing, incremental graphing, force-scan, and DAG algorithms. The author proposes a novel algorithm, inspired by previously mentioned algorithms and optimization methods, designed to overcome existing limitations. This algorithm processes complex layouts provided in JSON/XML format and generates an optimized layout solution. It will simultaneously consider multiple criteria to get the most effective layout. The author's contribution introduces an approach which holds potential for further refinement and application to other types of UML diagrams. |
| Atslēgas vārdi |
UML stāvokļa diagramma, izkārtojuma algoritms, DAG izkārtojums, hierarhiskais izkārtojums, grafiku teorija, modelēšanas rīks, diagrammas zīmēšana |
| Atslēgas vārdi angļu valodā |
UML state chart, layout algorithm, DAG layout, hierarchical layout,Graph Theory, Modeling tool, graph drawing |
| Valoda |
eng |
| Gads |
2024 |
| Darba augšupielādes datums un laiks |
05.01.2024 23:58:46 |
