Publikationen von Stefan Wöhrle

Publikationen am Lehrstuhl für Informatik 7

[WGLW12] E. Weingaertner, R. Glebke, M. Lang, and K. Wehrle. Building a modular bittorrent model for ns-3. In Proceedings of the 2012 workshop on ns-3 (WNS3 2012), 3 2012.
[ Abstract ]
[WT07] Stefan Wöhrle and Wolfgang Thomas. Model checking synchronized products of infinite transition systems. Logical Methods in Computer Science, 3(4), 2007.
[ pdf | ps | Abstract ]
[Wöh05] S. Wöhrle. Decision problems over infinite graphs: Higher-order pushdown systems and synchronized products. PhD thesis, RWTH Aachen, 2005.
[ pdf | ps | Abstract ]
[GW04] M. Grohe and S. Wöhrle. An existential locality theorem. Annals of Pure and Applied Logic, 129:131-148, 2004.
[ Abstract ]
[WT04] S. Wöhrle and W. Thomas. Model checking synchronized products of infinite transition systems. In Proceedings of the 19th Annual Symposium on Logic in Computer Science (LICS), pages 2-11. IEEE Computer Society, 2004.
[ pdf | ps | Abstract ]
[ATW03] J. Altenbernd, W. Thomas, and S. Wöhrle. Tiling systems over infinite pictures and their acceptance conditions. In Proceedings of the 6th International Conference on Developements in Language Theory, DLT 2002, volume 2450 of Lecture Notes in Computer Science, pages 297-306. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[CW03] A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, volume 2914 of Lecture Notes in Computer Science, pages 112-123. Springer, 2003. (c) Springer.
[ pdf | ps | Abstract ]
[GW01] M. Grohe and S. Wöhrle. An existential locality theorem. In Proceedings of the 10th Annual Conference of the European Association for Computer Science Logic, CSL 2001, volume 2142 of Lecture Notes in Computer Science, pages 99-114. Springer, 2001. Full version [GW04]. (c) Springer.
[ pdf | ps | Abstract ]
[Wöh01] S. Wöhrle. Lokalität in der Logik und algorithmische Anwendungen. Diplomarbeit, Albert-Ludwigs-Universität Freiburg, 2001.