Personal Info about Daniel Klink


Daniel Klink

PhD Student

Room 4205

E-Mail: lastname@cs.rwth-aachen.de

Phone: +49-241-80-21212

 

 

 


Research

My research interests focus on Formal Methods, Model Checking in particular, for stochastic systems that embrace real-time behavior. Areas where such models (continuous-time Markov chains) are used frequently range from performance evaluation over dependability analysis to systems biology. As the analysis of such models is mainly restricted by memory consumption, I am investigating reduction methods such as abstraction to allow for more complex systems to be verified.

 


Publications

2012
DownloadJoost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf. Three-Valued Abstraction for Probabilistic Systems. Journal on Logic and Algebraic Programming 81(4), pages 356–389, 2012.
2011
DownloadDaniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen. Time-Bounded Reachability in Tree-Structured QBDs by Abstraction. Performance Evaluation 68(2), pages 105–125, 2011.
2010
DownloadDaniel Klink. Three-Valued Abstraction for Stochastic Systems. Phd Thesis at RWTH Aachen University, 2010.
2009
DownloadJoost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer. Compositional Abstraction for Stochastic Systems. Technical report at RWTH Aachen number AIB-2009-15, 2009.
DownloadDaniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen. Time-Bounded Reachability in Tree-Structured QBDs by Abstraction. Quantitative Evaluation of Systems (QEST), pages 133–142, IEEE CS Press, 2009.
DownloadJoost-Pieter Katoen, Daniel Klink, Martin R. Neuhäußer. Compositional Abstraction of Stochastic Systems . Formal Modeling and Analysis of Timed Systems (FORMATS), Volume 5813 of LNCS, pages 195–211, Springer, 2009.
2008
DownloadJoost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf. Abstraction for Stochastic Systems by Erlang's Method of Stages. 19th International Conference on Concurrency Theory (CONCUR'08), Volume 5201 of LNCS, pages 279–294, Springer, 2008.
2007
DownloadJoost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf. Three-valued abstraction for continuous-time Markov chains. Proceedings of the 19th International Conference on Computer Aided Verification (CAV), Volume 4590 of Lecture Notes in Computer Science, pages 311–324, Springer Verlag, 2007.


Teaching

  • Übung zu "Programmierung für alle" (WS 2009/10)
  • Proseminar "Berüchtigte Fehler in Softwaresystemen" (WS 2009/10)
  • Seminar "Model Checking Probabilistic Systems" (SS 2009)
  • Übung zu "Modellierung nebenläufiger und probabilistischer Systeme" (SS 2009)
  • Seminar "Timed Automata" (WS 2008/09)
  • Proseminar "Berüchtigte Fehler in Softwaresystemen" (WS 2008/09)
  • Proseminar "Spezifikationsformalismen" (SS 2008)
  • Übung zu "Compiler Construction" (SS 2008)
  • Seminar "Software Abstractions" (WS 2007/08)
  • Übung zu "Semantics and Verification of Software" (SS 2007)
  • Proseminar "Verteilte Algorithmen" (WS 2006/07)

 


Miscellaneous