Selected publications

• Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Learning of event-recording automata. Theoretical Computer Science, 411(47):4029–4054, October 2010. (PostScript) (PDF) (bibtex)

• Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Learning communicating automata from MSCs. IEEE Transactions on Software Engineering (TSE), 36(3):390–408, May/June 2010. (PDF) (bibtex)

• Andreas Bauer, Martin Leucker, and Christian Schallhart. Runtime verification for LTL and TLTL. ACM Transactions on Software Engineering and Methodology (TOSEM), 2009. in press. (PDF) (bibtex)

• Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. Angluin-style learning of NFA. In 21st International Joint Conference on Artifical Intelligence (IJCAI'09), July 2009. (bibtex). see also [LSV:08:28]

• Martin Leucker and Christian Schallhart. A brief account of runtime verification. Journal of Logic and Algebraic Programming, 78(5):293–303, may/june 2009. (PDF) (bibtex)

• Andreas Bauer, Martin Leucker, and Christian Schallhart. Comparing LTL semantics for runtime verification. Journal of Logic and Computation, 20(3):651–674, 2010. (PostScript) (PDF) (bibtex). see also [LeuckerBS08TR]

• Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf. Abstraction for stochastic systems by Erlang's method of stages. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, Toronto, Canada, August 2008. Springer. (PDF) (bibtex)

• Andreas Bauer, Martin Leucker, and Christian Schallhart. The good, the bad, and the ugly—but how ugly is ugly?. Technical Report TUM-I0803, TU München, 2008. (PostScript) (PDF) (bibtex)

• Andreas Bauer, Martin Leucker, and Christian Schallhart. Runtime verification for LTL and TLTL. Technical Report TUM-I0724, TU München, 2007. (PostScript) (PDF) (bibtex)

• Martin Leucker. Learning meets verification. volume 4709 of Lecture Notes in Computer Science, pages 127–151. Springer, 2007. (PostScript) (PDF) (bibtex)

• Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf. Three-valued abstraction for continuous-time Markov chains. In Werner Damm and Holger Herrmanns, editors, Proceedings of 19th International Conference on Computer-Aided Verification (CAV'07), volume 4590 of Lecture Notes in Computer Science, pages 316–329. Springer, 2007. (PostScript) (PDF) (bibtex)

• Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker. Replaying play in and play out: Synthesis of design models from scenarios by learning. In Orna Grumberg and Michael Huth, editors, Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07), volume 4424 of Lecture Notes in Computer Science, Braga, Portugal, March 2007. Springer. (PostScript) (PDF) (bibtex)

• Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. When not losing is better than winning: Abstraction and refinement for the full μ-calculus. Information and Computation, 205(8):1130–1148, aug 2007. (PostScript) (PDF) (bibtex)

• Andreas Bauer, Martin Leucker, and Christian Schallhart. Monitoring of real-time properties. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of Lecture Notes in Computer Science, Kolkata, India, December 2006. Springer-Verlag. (PostScript) (PDF) (bibtex)

• Olga Grinchtein, Martin Leucker, and Nir Piterman. Inferring network invariants automatically. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of Lecture Notes in Artificial Itelligence, September 2006. (PostScript) (PDF) (bibtex) (abstract)

• Olga Grinchtein and Martin Leucker. Network invariants for real-time systems. Formal Aspects of Computing, 20:619–635, 2008. (PDF) (bibtex). see also [GrinchteinL03]

• Benedikt Bollig and Martin Leucker. Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science, 358(2-3):150–172, 2006. (PostScript) (PDF) (bibtex)

• Orna Grumberg, Martin Lange, Martin Leucker, and Sharon Shoham. Don't know in the μ-calculus. In Proceedings of the 6th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science. Springer, 2005. (PostScript) (PDF) (bibtex)

• Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Learning of event-recording automata. In Proceedings of the Joint Conferences FORMATS and FTRTFT, volume 3253 of Lecture Notes in Computer Science, September 2004. (PostScript) (PDF) (bibtex) (abstract)

• Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, and Frank Ciesinski. Controller synthesis for probabilistic systems. In Proceedings of the IFIP International Conference on Theoretical Computer Science, IFIP TCS2004. Kluwer, August 2004. (bibtex)

• Benedikt Bollig and Martin Leucker. Deciding LTL over Mazurkiewicz traces. Data & Knowledge Engineering, 44/2:221–240, February 2003. (PDF) (bibtex)

• Martin Leucker, P. Madhusudan, and Supratik Mukhopadhyay. Dynamic message sequence charts. In M. Agrawal and A. Seth, editors, Proceedings of 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), volume 2556 of Lecture Notes in Computer Science. Springer, December 2002. (PostScript) (PDF) (bibtex)

• Benedikt Bollig, Martin Leucker, and Michael Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002. (PDF) (bibtex). see also [BolligLeuckerWeber01]

• Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised regular MSC languages. In Mogens Nielsen, editor, Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS '02), volume 2303 of Lecture Notes in Computer Science, pages 52–66. Springer-Verlag Inc., 2002. (bibtex)