![](bgc.png)
As part of future work, the algorithm should infer the
model order of these nodes.
Lingua Franca proposes another additional use
case in form of hyperedges, which are currently
treated as normal edges. Future work should investi-
gate what special treatment might be required to apply
model order to more general graphs.
Lingua Franca does not explicitly model edges but
rather ports. Future work should investigate whether
the port and edge order, which are handled equiv-
alently in SCCharts, need to be distinguished for
Lingua-Franca-like languages by having on explicit
order for input ports.
(Purchase, 1997) found that user performance
increased from drawings from medium symmetric
drawings to fully symmetric drawings. Since the na-
ture of model order and the grouping it creates relates
to the way symmetry allows us to quickly access a
model, part of future work should focus on whether
model order is also more effective if everything or
nearly everything is ordered.
Since the model order tends to produce more sta-
ble layouts than randomized solutions, its relation to
the mental map should be investigated, as it is deemed
as one of the most important aspects of graph draw-
ing (Purchase et al., 2006). In particular, it should be
investigated whether the mental map, which is repre-
sented by the textual and graphical model, is empha-
sized using model order in an interactive scenario.
REFERENCES
B
¨
ohringer, K.-F. and Paulisch, F. N. (1990). Using con-
straints to achieve stability in automatic graph layout
algorithms. In Proceedings of the SIGCHI Conference
on Human Factors in Computing Systems, pages 43–
51, New York. ACM.
Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. G.
(1999). Graph Drawing: Algorithms for the Visual-
ization of Graphs. Prentice Hall.
Domr
¨
os, S. and von Hanxleden, R. (2022). Preserving or-
der during crossing minimization in sugiyama layouts.
In Proceedings of the 14th International Conference
on Information Visualization Theory and Applications
(IVAPP’22), part of the 17th International Joint Con-
ference on Computer Vision, Imaging and Computer
Graphics Theory and Applications (VISIGRAPP’22),
pages 156–163. INSTICC, SciTePress.
Eades, P., Lin, X., and Smyth, W. F. (1993). A fast and
effective heuristic for the feedback arc set problem.
Information Processing Letters, 47(6):319–323.
Fuhrmann, H. and von Hanxleden, R. (2010). On the prag-
matics of model-based design. In Proceedings of the
15th Monterey Workshop 2008 on the Foundations
of Computer Software. Future Trends and Techniques
for Development, Revised Selected Papers, volume
6028 of LNCS, pages 116–140, Budapest, Hungary.
Springer.
Gansner, E. R., Koutsofios, E., North, S. C., and Vo, K.-
P. (1993). A technique for drawing directed graphs.
Software Engineering, 19(3):214–230.
Kieffer, S., Dwyer, T., Marriott, K., and Wybrow, M.
(2016). HOLA: human-like orthogonal network lay-
out. IEEE Trans. Vis. Comput. Graph., 22(1):349–
358.
Lohstroh, M., Menard, C., Bateni, S., and Lee, E. A. (2021).
Toward a Lingua Franca for Deterministic Concurrent
Systems. ACM Transactions on Embedded Computing
Systems (TECS), 20(4):Article 36.
Mennens, R. J., Scheepens, R., and Westenberg, M. A.
(2019). A stable graph layout algorithm for processes.
In Computer Graphics Forum, volume 38, pages 725–
737. Wiley Online Library.
Nikolov, N. S. and Tarassov, A. (2006). Graph layering by
promotion of nodes. Discrete Applied Mathematics,
154(5):848–860.
Purchase, H. C. (1997). Which aesthetic has the greatest
effect on human understanding? In Proceedings of the
5th International Symposium on Graph Drawing (GD
’97), volume 1353 of LNCS, pages 248–261. Springer.
Purchase, H. C., Hoggan, E. E., and G
¨
org, C. (2006). How
important is the “mental map”? – an empirical in-
vestigation of a dynamic graph layout algorithm. In
Proceedings of the 14th International Symposium on
Graph Drawing (GD ’06), volume 4372 of LNCS,
pages 184–195. Springer.
Schulze, C. D., Sp
¨
onemann, M., and von Hanxleden, R.
(2014). Drawing layered graphs with port constraints.
Journal of Visual Languages and Computing, Special
Issue on Diagram Aesthetics and Layout, 25(2):89–
106.
Sugiyama, K., Tagawa, S., and Toda, M. (1981). Methods
for visual understanding of hierarchical system struc-
tures. IEEE Transactions on Systems, Man and Cy-
bernetics, 11(2):109–125.
von Hanxleden, R., Duderstadt, B., Motika, C., Smyth, S.,
Mendler, M., Aguado, J., Mercer, S., and O’Brien,
O. (2014). SCCharts: Sequentially Constructive
Statecharts for safety-critical applications. In Proc.
ACM SIGPLAN Conference on Programming Lan-
guage Design and Implementation (PLDI ’14), pages
372–383, Edinburgh, UK. ACM.
von Hanxleden, R., Lee, E. A., Fuhrmann, H., Schulz-
Rosengarten, A., Domr
¨
os, S., Lohstroh, M., Bateni,
S., and Menard, C. (2022). Pragmatics twelve years
later: a report on lingua franca. In International Sym-
posium on Leveraging Applications of Formal Meth-
ods, pages 60–89. Springer.
Waddle, V. (2001). Graph layout for displaying data struc-
tures. In Proceedings of the 8th International Sympo-
sium on Graph Drawing (GD ’00), volume 1984 of
LNCS, pages 98–103. Springer.
IVAPP 2023 - 14th International Conference on Information Visualization Theory and Applications
88