|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Towards trace metrics via functor lifting. In Lawrence S. Moss and Paweł Sobociński, editors, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO'15), volume 35 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35–49. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, oct 2015. |
|
|
Harsh Beohar and Pieter Cuijpers. Open maps in concrete categories and branching bisimulation for prefix orders. In Mathematical Foundations of Programming Semantics, Nijmegen, May 2015. ENTCS. In press. |
|
|
Harsh Beohar and Mohammad Mousavi. A Pre-congruence Format for XY-simulations. In The 6th International Conference on Fundamentals of Software Engineering, LNCS, Tehran, Iran, March 2015. Springer Verlag. |
|
|
Harsh Beohar, Mahsa Varshosaz, and Mohammad Reza Mousavi. Basic behavioral models for software product lines: Expressiveness and testing pre-orders. Science of Computer Programming, 2015. In press. |
|
|
Bnjamin Cabrera. Numerical schemes for calculating the discrete wasserstein distance. Master's thesis, University of Bonn, Germany, 2015. |
|
|
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Robustness and closure properties of recognizable languages in adhesive categories. Science of Computer Programming, 104:71–98, 2015. |
|
|
H.J. Sander Bruggink, Barbara König, Dennis Nolte, and Hans Zantema. Proving termination of graph transformation systems using weighted type graphs over semirings. In Proc. of ICGT '15 (International Conference on Graph Transformation), pages 52–68. Springer, 2015. LNCS 9151. |
|
|
H.J. Sander Bruggink, Barbara König, Dennis Nolte, and Hans Zantema. Proving termination of graph transformation systems using weighted type graphs over semirings, 2015. arXiv:1505.01695. |
|
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Towards trace metrics via functor lifting, 2015. arXiv:1505.08105. |
|
|
Parosh Aziz Abdulla, Fabio Gadducci, Barbara König, and Viktor Vafeiadis. Verification of Evolving Graph Structures (Dagstuhl Seminar 15451). Dagstuhl Reports, 5(11), 2015. |
|
|
H. J. Sander Bruggink, Barbara König, and Sebastian Küpper. Robustness and closure properties of recognizable languages in adhesive categories. Sci. Comput. Program., 104:71–98, 2015. |
|
|
Christine Mika. Ein generisches Werkzeug für Sprachäquivalenz bei gewichteten Automaten. Master's thesis, Universität Duisburg-Essen, 2015. |
|
|
Jan Stückrath. Uncover: Using coverability analysis for verifying graph transformation systems. In Francesco Parisi-Presicce and Bernhard Westfechtel, editors, Proceedings of ICGT 2015, volume 9151 of LNCS, pages 266–274. Springer, 2015. |
|
