Rastislav Lenhardt

Rastislav Lenhardt

Doctoral Student

Leaving date: 13th December 2013

Themes:

• Automated Verification

Completed Projects:

• more…

See Also:

• External Web Page

Interests

My main interests are algorithms and complexity of Probabilistic Verification (with properties mostly specified as fragments of LTL or FO). In general I am also interested in using randomization in designing algorithms and in combinatorial game theory.

Selected Publications

View AllManage publications

• Probabilistic Automata with Parameters

  Rastislav Lenhardt

  Master's Thesis 2009.

  Details about Probabilistic Automata with Parameters | BibTeX data for Probabilistic Automata with Parameters | Download  (pdf) of Probabilistic Automata with Parameters

• Composite Mathematical Games

  Rastislav Lenhardt

  2007.

  Details about Composite Mathematical Games | BibTeX data for Composite Mathematical Games | Download  (pdf) of Composite Mathematical Games

Activities

• Quantitative Analysis and Verification

Completed Projects

• Model Checking Timed Systems with Restricted Resources: Algorithms and Complexity

Supervisor