Universität Leipzig    Institut für Informatik    Automaten und Sprachen    Karin Quaas
Karin Quaas
Fully Refereed Papers
	Recognizability of the Support of Recognizable Series over the Semiring of the Integers is Undecidable (with D. Kirsten). In Information Processing Letters, 111(10):500-502, 2011.
	MSO Logics for Weighted Timed Automata. In Formal Methods in System Design, 38(3):193-222, 2011.
	A Kleene-Schützenberger Theorem for Weighted Timed Automata (with M.Droste). In Theoret. Comp. Science 412: 1140-1153, 2011.
	A Universality Analysis for One-Clock Timed Automata (with P.A. Abdulla, J. Deneux, J.Ouaknine and J.Worrell). In Fundamenta Informaticae 89(4):419-450, 2008.ps pdf
Refereed Conference Papers
	On the Interval-Bound Problem for Weighted Timed Automata. In Language and Automata Theory and Applications (LATA 2011), 452-464, Springer LNCS, Volume 6638.
	On the Supports of Recognizable Timed Series. In Formal Modeling and Analysis of Timed Systems (FORMATS 2009), 243-257, Springer LNCS, Volume 5813.ps pdf
	Weighted Timed MSO Logics. In Developments in Language Theory (DLT 2009), 419-430, Springer LNCS, Volume 5583.ps pdf
	A Kleene-Schützenberger Theorem for Weighted Timed Automata (with M.Droste). In Foundations of Software Science and Computational Structures (FoSSaCS 2008), 142-156, Springer LNCS, Volume 4962.ps pdf
	Zone-Based Universality Analysis for Single-Clock Timed Automata (with P.A.Abdulla, J.Ouaknine and J.Worrell). In International Symposium on Fundamentals of Software Engineering 2007, 98-112, Springer LNCS, Volume 4767.ps pdf
PhD Thesis
	Kleene-Schützenberger and Büchi Theorems for Weighted Timed Automata. ps pdf