...

• Tight Packing of Connected Components (Bachelor)
  Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
  

  Jira
  server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1262

  
  

  Jira
  server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1031

• Layering Algorithms (Bachelor, Master)
  Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
• Combining Forces and Layers (Master)
  Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.
• Node Placement With a Focus on Compactness (Master)
  Node placement algorithms often try to draw as many edges as straight lines as possible. However, that usually results in less compact diagrams. The focus of this topic would be to devise or adapt a node placement algorithm that tries to strike a balance between straightness and compactness.
• Force Based Drawing with Port Constraints (Master)
  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 on the model library of Ptolemy.
  
  
• Compound Graph Layout (Master)
  Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on maintainability: ensuring that the implementation can be kept working over the years. The main area to be considered here is the crossing minimization phase.
• Orthogonal "Edge Bundling" (Bachelor, Master)
  Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
  
  
• Integrate KIML with JGraph (Bachelor)
  Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
  

  Jira
  showSummary true server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1214

  
  
  

...

• Real-time extensions for SCCharts (Bachelor/Master)
  Make the timing instructions delay_until und exception_on_expire of the FlexPRET processor available in SCCharts.

Model-based Design

BetreuungAdvisors: Christian Motika

Heute haben sich eine ganze Reihe von Modellierungssprachen durchgesetzt, die grafische Modelle verwenden. Dazu zählen beispielsweise die Unified Modeling Language (UML) oder die Werkzeugketten Simulink/Stateflow von Mathworks und SCADE von Esterel-Technologies. Letztere werden insbesondere auch im Entwurf eingebetteter und sicherheitskritischer Systeme (z.B. in Fahr- und Flugzeugen) eingesetzt.

...