2006
Somesh Jha, Stefan Schwoon, Hao Wang, and Thomas Reps. Weighted pushdown systems and trust-management systems. In Holger Hermanns and Jens Palsberg, editors, Proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 3920 of Lecture Notes in Computer Science, pages 1–26, Vienna, Austria, 2006. Springer. Invited paper.	PDF (357 kB) Info Tech report version
2005
Barbara König and Vitali Kozioura. Augur—a tool for the analysis of graph transformation systems. EATCS Bulletin, 87:125–137, November 2005. Appeared in The Formal Specification Column.	GZipped PostScript (172 kB) PDF (256 kB) Info
Barbara König, Ugo Montanari, and Philippa Gardner, editors. Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005.	PDF (351 kB) Info See drops.dagstuhl.de ...
Paolo Baldan, Barbara König, and Arend Rensink. Graph grammar verification through abstraction. In Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005.	PDF (330 kB) Info See drops.dagstuhl.de ...
2004
Markus Holzer and Barbara König. Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin, 83:139–155, June 2004. Appeared in The Formal Language Theory Column.	GZipped PostScript (74 kB) PDF (140 kB) Info
Herrman Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In 14. Theorietag der GI-Fachgruppe 0.1.5 ``Automaten und Formale Sprachen''. Universität Potsdam, 2004.	Info
2003
Wilfried Brauer, Markus Holzer, Barbara König, and Stefan Schwoon. The theory of finite-state adventures. EATCS Bulletin, 79:230–237, February 2003.	GZipped PostScript (111 kB) PDF (218 kB) Info
Tero Harju and Dirk Nowotka. Periodicity and unbordered segments of words. Bull. EATCS, 80:162–167, 2003.	GZipped PostScript (41 kB) PDF (103 kB) Info
2002
Stefan Schwoon. Determinization and complementation of Streett automata. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors, Automata, Logics, and Infinite Games, volume 2500 of Lecture Notes in Computer Science, chapter 5, pages 79–91. Springer, 2002.	Info See estragon.ti.informatik.uni-kiel.de ...
2000
Javier Esparza, Peter Rossmanith, and Stefan Schwoon. A uniform framework for problems on context-free grammars. EATCS Bulletin, 72:169–177, October 2000.	GZipped PostScript (46 kB) Info