<
From version < 12.1 >
edited by cds
on 2012/09/28 14:45
To version < 11.1 >
edited by cds
on 2012/09/28 14:23
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -2,24 +2,20 @@
2 2  
3 3  = Bachelor Topics =
4 4  
5 -* **Control Flow Graph Exploration / Visualization**
5 +* **Control flow graph exploration/visualization**
6 6  Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using Klighd.
7 -* **SyncCharts and Actor Model Visualization**
7 +* **SyncCharts and actor model visualization**
8 8  Develop an integrated viewer for [[doc:SyncCharts]] and [[KAOM>>doc:Actor Oriented Modeling (KAOM)]] models using [[KLighD>>doc:Lightweight Diagrams (KLighD)]], including view management techniques such as focus & context and structure-based editing.
9 -* **Validation Manager for Models**
9 +* **Validation manager for models**
10 10  Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
11 11  * **Esterel / SyncCharts Validation**
12 12  Automate the validation for a (generic) SyncCharts simulator employing the Esterel simulator and the Esterel to SyncCharts transformation.
13 13  * **Transformation from SyncCharts to Esterel** [possibly also Master Topic]
14 14  Develop a transformation in Xtend2 to generate Esterel code for SyncCharts.
15 -* **Layering Algorithms**
15 +* **Layering algorithms**
16 16  Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
17 17  * **Heuristics for Side Aware Edge Label Placement**
18 18  Think about and implement heuristic algorithms for solving the edge aware edge label placement problem for placing edge labels in data flow diagrams.
19 -* **Implement Greedy Switch Heuristic for Crossing Minimization**
20 -The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for.
21 -* **Add Support for Self Loops for Polyline / Spline Layouts
22 -**Self loops, that is, edges connecting a node with itself, need to be properly routed. This is already implemented for orthogonal edge routing, but is still an open problem for spline and polyline edge routing.
23 23  * **Incremental Update for Klighd**
24 24  Incremental update of Klighd data structure after editing.
25 25  * **Visualizing Model Edits/Changes**
... ... @@ -31,7 +31,7 @@
31 31  Develop a SyncChart-Editor based on Yakindu, including basic pragmatics concept (automatic layout, collapse/expand, structure-based editing) and interfacing to host-language.
32 32  * **FPGA Statecharts**
33 33  Development of a Statecharts editor, based on .NET, WPF, MS Silverlight. Synthesis onto FPGAs with a data-flow-based intermediate format.
34 -* **Diagram Description Language**
30 +* **Diagram description language**
35 35  Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
36 36  * **[Quartz]**
37 37  Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -2981908
1 +2981906
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/2981908/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/2981906/Topics for Student Theses