H. J. Sander Bruggink

Available identifiers

zbMath Open bruggink.h-j-sanderMaRDI QIDQ2911623

List of research outcomes

Publication	Date of Publication	Type
A flexible and easy-to-use library for the rapid development of graph tools in Java	2022-09-01	Paper
Recognizable languages of arrows and cospans	2018-09-05	Paper
Proving termination of graph transformation systems using weighted type graphs over semirings	2015-09-22	Paper
Towards Process Mining with Graph Transformation Systems	2014-09-26	Paper
Termination analysis for graph transformation systems	2014-09-15	Paper
Termination of cycle rewriting	2014-07-24	Paper
Towards a systematic method for proving termination of graph transformation systems	2014-03-26	Paper
Efficient symbolic implementation of graph automata with applications to invariant checking	2012-10-02	Paper
Conditional reactive systems	2012-08-31	Paper
A logic on subobjects and recognizability	2010-10-27	Paper
On the Recognizability of Arrow and Graph Languages	2008-11-20	Paper
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property	2008-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q4447227	2004-02-16	Paper

Research outcomes over time

This page was built for person: H. J. Sander Bruggink