Section: Partnerships and Cooperations

International Initiatives

Inria Associate Teams Not Involved in an Inria International Labs

EQUAVE

• Title: Efficient Quantitative Verification

• International Partner (Institution - Laboratory - Researcher):

  • Indian Institute of Technology Bombay (India) - Dpt of Computer Science and Engineering - S. Akshay

• Start year: 2018

• See also: http://www.irisa.fr/sumo/EQUAVE

• Formal verification has been addressed for a long time. A lot of effort has been devoted to boolean verification, i.e., formal analyis of systems that check whether a given property is true or false.

  In many settings, a boolean verdict is not sufficient. The notions of interest are for instance the amount of confidential information leaked by a system, the proportion of some protein after a duration in some experiment in a biological system, whether a distributed protocol satisfies some property only for a bounded number of participants... This calls for quantitative verification, in which algorithms compute a value such as the probability for a property to hold, the mean cost of runs satisfying it, the time needed to achieve a complex workflow...

  A second limitation of formal verification is the efficiency of algorithms. Even for simple questions, verification is rapidly PSPACE-complete. However, some classes of models allow polynomial time verification. The key techniques to master complexity are to use concurrency, approximation, etc

  The objective of this project is to study efficient techniques for quantitative verification, and develop efficient algorithms for models such as stochastic games, timed and concurrent systems,

QuantProb

• Title: Quantitative analysis of non-standard properties in probabilistic models

• International Partner (Institution - Laboratory - Researcher):

  • Technical University of Dresde (Germany), Faculty of Computer Science, Christel Baier

• Start year: 2016

• See also: http://www.irisa.fr/sumo/QuantProb/

• Quantitative information flow and fault diagnosis share two important characteristics: quantities (in the description of the system as well as in the properties of interest), and users partial knowledge. Yet, in spite of their similar nature, different formalisms have been proposed. Beyond these two motivating examples, defining a unified framework can be addressed by formal methods. Formal methods have proved to be effective to verify, diagnose, optimize and control qualitative properties of dynamic systems. However, they fall short of modelling and mastering quantitative features such as costs, energy, time, probabilities, and robustness, in a partial observation setting. This project proposal aims at developing theoretical foundations of formal methods for the quantitative analysis of partially observable systems.

Inria International Partners

Informal International Partners

The team collaborates with the following researchers:

• Jean-François Raskin, Gilles Geeraerts (Université Libre de Bruxelles, Belgium) on multiplayer game theory and synthesis;

• Thomas Brihaye (U Mons, Belgium) on the verification of stochastic timed systems;

• Mickael Randour (U Mons, Belgium) on quantitative games for synthesis;

• Kim G. Larsen (U Aalborg, Denmark) on quantitative timed games, and on topics related to urban train systems modeling;

• Josef Widder, Marijana Laźic (TU Wien, Austria), Igor Konnov (Inria Nancy, LORIA) on the automated verification of randomized distributed algorithms.

• John Mullins (Polytechnique Montréal, Canada), on topics related to security and opacity;

• S. Akshay (IIT Bombay, India) on topics related to timed concurrent models;

• Andrea D'ariano (University Roma Tre, Italy), on topics related to train regulation.

• Alessandro Giua and Michele Pinna (Univ. Cagliari, Italy), on diagnosis and unfolding techniques for concurrent systems.