Skip to Content

Changes for page Available Topics

Last modified by Maximilian Kasperowski on 2026/03/09 09:06
From version 78.1
edited by uru
on 2016/08/23 15:04
Change comment: There is no comment for this version
To version 81.1
edited by ssm
on 2016/08/23 15:56
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.uru
1 +XWiki.ssm
Content
... ... @@ -41,7 +41,7 @@
41 41  
42 42  
43 43  
44 -* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor/Master)
44 +* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
45 45  Evaluate options how to create constraints on the layout like "Node x should be placed at position y" and how to implement this in the current layout algorithms. Assess how such constraints can be persisted within the model.
46 46  * **3 Force Based Drawing with Port Constraints** (Master)
47 47  Develop methods for integrating port constraints in force-based drawing approaches. The resulting node placement shall be evaluated using an edge router such as [[libavoid>>url:http://www.adaptagrams.org/||shape="rect"]] on the model library of [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]].
... ... @@ -50,7 +50,7 @@
50 50  
51 51  
52 52  
53 -* **1 A Simple Edge Router** (Bachelor)
53 +* **1 A (Simple) Edge Router** (Bachelor, Master)
54 54  Often, people want their nodes to stay in the same place, but have the edges routed somehow. We currently don't have any layout algorithm that can do so. In this assignment, you would implement a simple edge router to solve this.
55 55  * **1 Improved Spline Edge Routing **(Master)
56 56  Our layer-based layout algorithm is capable to route edges as splines. Evaluate the results using state machine diagrams, identify possible improvements and develop solutions to address these.
... ... @@ -101,6 +101,7 @@
101 101  Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
102 102  * **Incremental Compilation of SCEst** (Bachelor/Master)
103 103  Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
104 +For Master Students: Also add the possibility to compile from SCCharts to SCEst.
104 104  * **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
105 105  Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
106 106  * **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
... ... @@ -107,6 +107,8 @@
107 107  Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
108 108  * **Transformation of Circuits to SCCharts** (Bachelor/Master)
109 109  Implement a transformation that translates circuits to (dataflow) SCCharts.
111 +* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
112 +Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
110 110  
111 111  
112 112  
... ... @@ -120,6 +120,8 @@
120 120  Add the possibility to perfom model checking on SCCharts
121 121  * **Core SCCharts Interpreter** (Master/Bachelor)
122 122  Implement an Interpreter for Core SCCharts.
126 +* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
127 +Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
123 123  
124 124  
125 125  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -20152355
1 +20153068
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20152355/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20153068/Topics for Student Theses