Games and Probabilistic Models in Formal Verification

Aim

Formal methods are widely used in development and analysis of complex systems such as aircraft flight control systems, controllers of industrial processes, biological processes etc. These systems usually exhibit features such as randomness, interaction and parallelism. Probabilistic and game theoretic models are especially well suited for capturing these features and therefore there is a need to develop such models and methods for their analysis. The goal of this workshop is to bring together researchers with interest in probabilistic and game theoretic methods in formal verification.

Topics

• algorithms for finite and infinite games
• automata theory and games
• timed games
• probabilistic models for verification
• decision processes and stochastic games
• logics for probabilistic models and games
• probabilistic model checking

Invited Speakers

• Thomas Brihaye, Universite de Mons
• Javier Esparza, TU Munich
• Hugo Gimbert, CNRS Bordeaux
• Marcus Groesser, TU Dresden

Submissions

GPMFV 2010 provides a forum for presentations of recent results in the above areas. We impose no restriction on previous or future publication of presented results. The selection of presentations will be based on one-page abstracts submitted via EasyChair.

Important Dates

• Submission deadline for presentations: 10 May 2010
• Notification: 31 May 2010
• Workshop: 28 August 2010

Program Committee

• Christel Baier, TU Dresden
• Tomas Brazdil, Masaryk Univ. (PC co-chair)
• Krishnendu Chatterjee, IST Austria (PC co-chair)
• Kousha Etessami, Univ. Edinburgh
• Erich Graedel, RWTH Aachen
• Damian Niwinski, Univ. Warsaw
• Joel Ouaknine, Univ. Oxford
• Olivier Serre, LIAFA Paris