Bisimulation Theory for Graph Transformation Systems. - Mathias Hülsbusch (ICGT, 2010)

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. - Mathias Hülsbusch; Barbara König 001; Arend Rensink; Maria Semenyak; Christian Soltenborn; Heike Wehrheim (IFM, 2010)

Specification and Verification of Model Transformations. - Frank Hermann 001; Mathias Hülsbusch; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Conditional Reactive Systems. - H. J. Sander Bruggink; Raphaël Cauderlier; Mathias Hülsbusch; Barbara König 001 (FSTTCS, 2011)

Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages. - H. J. Sander Bruggink; Mathias Hülsbusch (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Application Conditions for Reactive Systems with Applications to Bisimulation Theory. - Mathias Hülsbusch (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Deriving Bisimulation Congruences for Conditional Reactive Systems. - Mathias Hülsbusch; Barbara König 001 (FoSSaCS, 2012)

Towards Alternating Automata for Graph Languages. - H. J. Sander Bruggink; Mathias Hülsbusch; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Conditional Bisimilarity for Reactive Systems. - Mathias Hülsbusch; Barbara König 001; Sebastian Küpper; Lara Stoltenow (Log. Methods Comput. Sci., 2022)