2014 |
|
Hans Zantema, Barbara König, and H.J. Sander Bruggink. Termination of cycle rewriting. In Proceedings of RTA-TLCA 2014, 2014. |
|
|
H.J. Sander Bruggink. Towards process mining with graph transformation systems. In Proceedings of ICGT 2014, 2014. |
|
|
H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. In Proceedings of IFIP-TCS 2014, 2014. |
|
2013 |
|
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. Journal of Visual Languages and Computing, 24(3):192–206, 2013. |
|
|
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties in recognizable languages in adhesive categories. In Proceedings of GT-VNT 2013, volume 58 of Electronic Communications of the EASST, 2013. |
|
2012 |
|
H.J. Sander Bruggink, Mathias Hülsbusch, and Barbara König. Towards alternating automata for graph languages. In Proceedings of GT-VMT 2012, Electronic Communications of the EASST, 2012. |
|
|
Christoph Blume, H.J. Sander Bruggink, Dominik Engelke, and Barbara König. Efficient symbolic implementation of graph automata with applications to invariant checking. In Proceedings of ICGT 2012, 2012. |
|
2011 |
|
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions. In Proceedings of GT-VMT 2011, Electronic Communications of the EASST, 2011. |
|
|
H.J. Sander Bruggink and Mathias Hülsbusch. Decidability and expressiveness of finitely representable recognizable graph languages. In Proceedigs of GT-VMT 2011, Electronic Communications of the EASST, 2011. |
|
|
H.J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, and Barbara König. Conditional reactive systems. In Proceedings of FSTTCS 2011, volume 13 of Leibniz International Proceedings in Informatics (LIPIcs), 2011. |
|
2010 |
|
Christoph Blume, H.J. Sander Bruggink, and Barbara König. Recognizable graph languages for checking invariants. In Proceedings of GT-VMT 2010, Electronic Communications of the EASST, 2010. |
|
|
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proceedings of IFIP-TCS '10, 2010. |
|
2008 |
|
H.J. Sander Bruggink. Equivalence of reductions in higher-order rewriting. PhD thesis, Utrecht University, 2008. |
|
|
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08. Springer, 2008. LNCS. |
|
2007 |
|
H.J. Sander Bruggink. Towards a systematic method for proving termination of graph transformation systems. In Proceedings of GT-VC '07, 2007. |
|
2006 |
|
H.J. Sander Bruggink. A proof of finite family developments for higher-order rewriting using a prefix property. In Proceedings of RTA '06. Springer, 2006. |
|
2003 |
|
H.J. Sander Bruggink. Residuals in higher-order rewriting. In Proceedings of RTA '03. Springer, 2003. |
|
2001 |
|
H.J. Sander Bruggink. Discourse representation by hypergraphs. Master's thesis, Utrecht University, 2001. |
|
