Two Decades of Probabilistic Verification - Reflections and Perspectives

Short report of the workshop

Slides of Presentations

• Opening and introduction (Frits Vaandrager)
• How Fast and Fat is Your Probabilistic Model Checker (David Jansen)
• Tools
  • PRISM (Dave Parker)
  • MRMC (Joost-Pieter Katoen)
  • MOTOR (Henrik Bohnenkamp)
  • MOEBIUS (Kai Lampa)
  • SMART (Gianfranco Ciardo)
  • CADP (Nicolas Coste)
  • PReMo (Dominik Wojtczak)
  • APEX (Joel Ouaknine)
  • PIPE (William Knottenbelt)
  • CASPA (Matthias Kuntz and Johann Schuster)
  • CORAL (Marielle Stoelinga)
  • PASS (Bjoern Wachter)
  • Liquor/PROBMELA (Christel Baier/Frank Ciesinski/Marcus Groesser/Joachim Klein)
  • A Model Checking Competition? (Boudewijn Haverkort)
• Gossiping - Uniform Randomness versus Emergent Behavior (Maarten van Steen)
• Short presentations of solutions to joint case study
  • Program+Conclusions (Boudewijn Haverkort)
  • Gossiping or Spamming (Rena Bakhshi)
  • Mean Field Analysis of Gossip Protocols (Boudewijn Haverkort)
  • Gossiping with IOIMCs (Pepijn Crouzen)
  • Conclusions working group explicit state gossiping networks (Pepijn Crouzen)
• The Quest for Quantifiable Quality (Holger Hermanns)
• Leader Election for Anonymous Networks (Wan Fokkink)
• Presentations of theoretical puzzles
  • Restricting Schedulers (Sergio Giro)
  • Hiding Sensitive Information from the Scheduler (Kostas Chatzikokolakis)
  • Marielle Stoelinga
  • Inexact Arithmetic in Model Checking of DTMCs (Ralf Wimmer)
  • Gianfranco Ciardo
  • Estimation of the approximation errors using the IMC theory (Nicolas Coste)
  • Properties of Priced Probabilistic Timed Automata (Jasper Berendsen and David Jansen), Solution
  • The Collatz Conjecture (Boudewijn Haverkort)
• Presentations by PhD students/postdocs
  • Maria Mateescu
  • Lijun Zhang
  • Bjoern Wachter
  • Sven Johr
  • Pepijn Crouzen
  • Marcus Groesser
  • Reza Pulungan
  • Anne Remke
  • Johann Schuster
  • Matthias Kuntz
  • Nicolas Coste
  • Jasper Berendsen
• Probability and nondeterminism: a tour of probabilistic programming from abstraction techniques to the "refinement paradox" (Annabelle McIver)
• Abstraction in quantitative probabilistic model checking (Gethin Norman)