Ralf Wimmer

Ralf Wimmer

Auto-generated profile, based on publicly available information

Ralf Wimmer

Albert-Ludwigs-Universität Freiburg

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2014
Verified
Book Chapter
Closed access
PDF file
AEAbraham Erika
Abraham Erika
BBBernd Becker
Bernd Becker
CDChristian Dehnert
Christian Dehnert
NJNils Jansen
Nils Jansen
JKJoost-Pieter Katoen
Joost-Pieter Katoen
RWRalf Wimmer
Ralf Wimmer

1 January 2006
Verified
Book Chapter
Closed access
PDF file
RWRalf Wimmer
Ralf Wimmer
MHMarc Herbstritt
Marc Herbstritt
HHHolger Hermanns
Holger Hermanns
KSKelley Strampp
Kelley Strampp
BBBernd Becker
Bernd Becker

1 January 2012
Verified
Book Chapter
Closed access
PDF file
RWRalf Wimmer
Ralf Wimmer
NJNils Jansen
Nils Jansen
AEAbraham Erika
Abraham Erika
BBBernd Becker
Bernd Becker
JKJoost-Pieter Katoen
Joost-Pieter Katoen

1 September 2014 in Theoretical Computer Science
Verified
Journal Article
Closed access
RWRalf Wimmer
Ralf Wimmer
NJNils Jansen
Nils Jansen
AEAbraham Erika
Abraham Erika
JKJoost-Pieter Katoen
Joost-Pieter Katoen
BBBernd Becker
Bernd Becker

1 September 2010
Verified
Conference Paper
Closed access
RWRalf Wimmer
Ralf Wimmer
BBBettina Braitling
Bettina Braitling
BBBernd Becker
Bernd Becker
EHErnst Moritz Hahn
Ernst Moritz Hahn
PCPepijn Crouzen
Pepijn Crouzen
OTOliver Theel
Oliver Theel
Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scant attention in this area, at least from the implementation perspective. This paper studies the problem of how to efficiently realize an algorithm for computing optimal long-run average reward values for concurrent probabilistic systems. At its core is a variation of Howard and Veinott's algorithm for Markov decision processes, where symbolic and non-symbolic representations are intertwined in an effective manner: the state space is represented using binary decision diagrams, while the linear equation systems which have to be solved for the induced Markov chains to improve the current scheduler are solved using an explicit state representation. In order to keep the latter small, we apply a symbolic bisimulation minimization algorithm to the induced Markov chain. The scheduler improvement step itself is again performed on symbolic data structures. Practical evidence shows that the implementation is effective, and sometimes uses considerably less memory than a fully explicit implementation.

1 January 2008
Verified
Book Chapter
Closed access
PDF file
RWRalf Wimmer
Ralf Wimmer
BBBettina Braitling
Bettina Braitling
BBBernd Becker
Bernd Becker