<
From version < 85.1 >
edited by ssm
on 2016/12/21 14:24
To version < 78.1 >
edited by uru
on 2016/08/23 15:04
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.ssm
1 +XWiki.uru
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, Master)
53 +* **1 A Simple Edge Router** (Bachelor)
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.
... ... @@ -62,7 +62,7 @@
62 62  
63 63  = Modeling Pragmatics =
64 64  
65 -**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze
65 +**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
66 66  
67 67  * **1 Compound Graph Exploration** (Bachelor, Master)
68 68  A new graph exploration approach should be examined which is uses different zoom levels for different compound nodes. This tries to map the "Google Maps approach" of only showing the information of interest at any given zoom level to the field of graph exploration.
... ... @@ -73,7 +73,7 @@
73 73  
74 74  = Semantics, Synchronous Languages and Model-based Design =
75 75  
76 -**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden
76 +**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden, Insa Fuhrmann
77 77  
78 78  Heute haben sich eine ganze Reihe von Modellierungssprachen durchgesetzt, die grafische Modelle verwenden. Dazu zählen beispielsweise die [[Unified Modeling Language (UML) >>url:http://de.wikipedia.org/wiki/UML||shape="rect" class="external-link"]]oder die Werkzeugketten [[Simulink/Stateflow von Mathworks >>url:http://de.wikipedia.org/wiki/Simulink||shape="rect" class="external-link"]]und [[SCADE von Esterel-Technologies>>url:http://en.wikipedia.org/wiki/SCADE||shape="rect" class="external-link"]]. Letztere werden insbesondere auch im Entwurf eingebetteter und sicherheitskritischer Systeme (z.B. in Fahr- und Flugzeugen) eingesetzt.
79 79  
... ... @@ -88,60 +88,46 @@
88 88  
89 89  
90 90  
91 -//SCCharts Modelling & Transformations//
91 +* (% style="line-height: 1.4285715;" %)**On the Pragmatics of Interactive Timing Information Feedback for Graphical Modeling **(%%)(Bachelor)(% style="line-height: 1.4285715;" %)**
92 +**(%%)Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
92 92  
94 +
95 +
96 +* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
97 +Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
93 93  * (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
94 94  Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
100 +* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
101 +Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
102 +* **Incremental Compilation of SCEst** (Bachelor/Master)
103 +Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
104 +* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
105 +Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
106 +* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
107 +Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
95 95  * **Transformation of Circuits to SCCharts** (Bachelor/Master)
96 -* Implement a transformation that translates circuits to (dataflow) SCCharts.
97 -* **SCCharts Verification** (Master/Bachelor)
98 -Add the possibility to perfom model checking on SCCharts
99 -* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
100 -Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
101 -* **Raceyard evaluation** (Master)
102 -Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
109 +Implement a transformation that translates circuits to (dataflow) SCCharts.
103 103  
104 -//SCCharts Code Generation & Optimizations//
111 +
105 105  
106 -* **Optimization of the SCCharts compiler/transformations **(Bachelor/Master)
107 -Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
108 -* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
109 -Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
110 -* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
113 +* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
111 111  Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
112 112  * **Curing Schizophrenia in SCCharts **(Master/Bachelor)
113 113  Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
114 -
115 -//SCCharts Simulation//
116 -
117 -* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
118 -Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
119 -* **Environment Simulations for SCCharts** (Master/Bachelor)
117 +* **Environment Simulations for SCCharts** (Master/Bachelor)
120 120  Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
121 -* **Core SCCharts Interpreter** (Master/Bachelor)
119 +* **SCCharts Verification** (Master/Bachelor)
120 +Add the possibility to perfom model checking on SCCharts
121 +* **Core SCCharts Interpreter** (Master/Bachelor)
122 122  Implement an Interpreter for Core SCCharts.
123 123  
124 -//Model-based C Code Compilation//
124 +
125 125  
126 -* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
127 -Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
128 -* **Execution of Recursive Dataflow Code** (Master/Bachelor)
129 -* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
130 -Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
131 -For Master students: Implement both.
132 -
133 -//Synchronous Languages//
134 -
135 -* **Incremental Compilation of SCEst** (Bachelor/Master)
136 -Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
137 -For Master Students: Also add the possibility to compile from SCCharts to SCEst.
138 -* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
139 -Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
140 140  * **Quartz **(Master)
141 141  Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
128 +* **Raceyard evaluation** (Master)
129 +Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
142 142  
143 -
144 -
145 145  = (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
146 146  
147 147  **Advisors:** to be determined.
... ... @@ -148,6 +148,3 @@
148 148  
149 149  * **Developing an Info Screen** (Bachelor)
150 150  Info screens are screens that present data in ways that can be easily understood. This includes static data (project description graphics, members of a team, ...) as well as dynamically aggregated data (bug statistics, automatic build overviews, ...). This topic is about developing such an info screen for our group and making it easily configurable.
151 -\\
152 -* **Developing a domain specific language (DSL) for model railway control** (Bachelor/Master)
153 -We maintain a model railway installation as a demonstrator for our work and as a student teaching tool. Especially for demonstations to non-technical visitors we would like to have a simple language to create controllers for the railway.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -23068684
1 +20152355
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/23068684/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20152355/Topics for Student Theses