Graphs, Recognizability and Verification

To appear

H.J. Sander Bruggink and Barbara König. Recognizable languages of arrows. Mathematical Structures in Computer Science, to appear.
Info

2017

Jan Stückrath and Barbara König. A general framework for well-structured graph transformation systems. Information and Computation, 252:79–94, 2017.
Info
See www.sciencedirect.com ...

2016

Hans Zantema, Dennis Nolte, and Barbara König. Termination of term graph rewriting. In Proc. of WST '16 (Workshop on Termination), 2016.
Info
Jan Stückrath. Verification of well-structured graph transformation systems. PhD thesis, Universität Duisburg-Essen, 2016.
PDF (1 MB)
Info
See duepublico.uni-duisburg-essen.de ...

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.
Info
Extended version
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.
Info
See arxiv.org ...
Conference version
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.
PDF (228 kB)
Info

2014

H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. In Proceedings of IFIP-TCS 2014, 2014.
Info
Tech report version
H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. Technical report, University of Duisburg-Essen, 2014.
PDF (400 kB)
Info
Conference version
Hans Zantema, H.J. Sander Bruggink, and Barbara König. Termination of cycle rewriting. In Proc. of RTA-TLCA '14, pages 476–490. Springer, 2014. LNCS 8560.
Info
Barbara König and Jan Stückrath. A general framework for well-structured graph transformation systems. In Proc. of CONCUR '14, pages 467–481. Springer, 2014. LNCS/ARCoSS 8704.
Info
Extended version
Barbara König and Jan Stückrath. A general framework for well-structured graph transformation systems, 2014. arXiv:1406.4782.
Info
See arxiv.org ...
Conference version
Giorgio Delzanno and Jan Stückrath. Parameterized verification of graph transformation systems with whole neighbourhood operations. In Joël Ouaknine, Igor Potapov, and James Worrell, editors, RP'14, volume 8762 of LNCS, pages 72–84. Springer, 2014.
PDF (345 kB)
Info
Extended version
Giorgio Delzanno and Jan Stückrath. Parameterized verification of graph transformation systems with whole neighbourhood operations, 2014. arXiv:1407.4394.
Info
See arxiv.org ...

2013

H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties of recognizable languages in adhesive categories. In Proc. of GT-VMT '13 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 58 of Electronic Communications of the EASST, 2013.
Info
See journal.ub.tu-berlin.de ...
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 & Computing, 24(3):192–206, 2013.
Info
See dx.doi.org ...
Conference version

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.
PDF (256 kB)
Info
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, and Jan Stückrath. On the decidability status of reachability and coverability in graph transformation systems. In Proc. of RTA '12, volume 15 of LIPIcs, pages 101–116. Schloss Dagstuhl – Leibniz Center for Informatics, 2012.
PDF (592 kB)
Info
See drops.dagstuhl.de ...
Tech report version
Salil Joshi and Barbara König. Applying the graph minor theorem to the verification of graph transformation systems. Technical Report 2012-01, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 2012.
Info
See duepublico.uni-duisburg-essen.de ...
Christoph Blume, Sander Bruggink H., J., Dominik Engelke, and Barbara König. Efficient symbolic implementation of graph automata with applications to invariant checking. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 264–278. Springer, 2012. LNCS 7562.
Info
Barbara König and Jan Stückrath. Well-structured graph transformation systems with negative application conditions. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 89–95. Springer, 2012. LNCS 7562.
Info
Barbara König and Jan Stückrath. Well-structured graph transformation systems with negative application conditions. Technical Report 2012-03, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 2012.
Info
See duepublico.uni-duisburg-essen.de ...

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.
PDF (235 kB)
Info
Marvin Heumüller, Salil Joshi Barbara König, and Jan Stückrath>. Construction of pushout complements in the category of hypergraphs. In Proc. of GCM '10 (Workshop on Graph Computation Models), volume 39 of Electronic Communications of the EASST, 2011.
Info
See journal.ub.tu-berlin.de ...
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions. In Proc. of GT-VMT '11 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 41 of Electronic Communications of the EASST, 2011.
Info
See journal.ub.tu-berlin.de ...

2010

Christoph Blume, H.J. Sander Bruggink, and Barbara König. Recognizable graph languages for checking invariants. In Proc. of GT-VMT '10 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 29 of Electronic Communications of the EASST, 2010.
PDF (275 kB)
Info
Christoph Blume. Recognizable graph languages for the verification of dynamic systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Springer, 2010.
PDF (80 kB)
Info
Christoph Blume. Efficient implementation of automaton functors for the verification of graph transformation systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Electronic Communications of the EASST, 2010.
PDF (275 kB)
Info
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proc. of TCS '10, volume 323 of IFIP AICT, pages 197–212. Springer, 2010.
PDF (252 kB)
Info
See link.springer.com ...

2008

Salil Joshi and Barbara König. Applying the graph minor theorem to the verification of graph transformation systems. In Proc. of CAV '08, pages 214–226. Springer, 2008. LNCS 5123.
PDF (346 kB)
Info
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 336–350. Springer, 2008. LNCS 5214.
PDF (246 kB)
Info
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. Technical Report 2008-03, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 2008.
Info
See duepublico.uni-duisburg-essen.de ...
© University of Duisburg-Essen, Theoretical Computer Science group