Section: Partnerships and Cooperations

International Initiatives

Inria International Labs

LIRIMA: International Laboratory for Research in Computer Science and Applied Mathematics

FUCHSIA

• Associate Team involved in the international lab LIRIMA.

• Title: Flexible user-centric higher-order systems for collective intelligence in agencies

• International Partner

  • U. Yaoundé (Cameroon) Georges-Edouard Kouamou

• Start year: 2019

• See also: https://project.inria.fr/fuchsia/

• Develop methods and tools, based on guarded attribute grammars, to design flexible and adaptive systems for information gathering and deliberation in order to collaboratively build expertise in health emergency situations.

Inria Associate Teams Not Involved in an Inria International Labs

EQUAVE

• Title: Efficient Quantitative Verification

• International Partner

  • 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.

Inria International Partners

Informal International Partners

The team collaborates with the following researchers:

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

• Andrea D'Ariano (University Roma Tre, Italy), on train regulation.

• Christel Baier (Technical University of Dresden, Germany) on verification and control of stochastic systems;

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

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

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

• Igor Konnov (Interchain, Austria), Marijana Laźic (Technical University Munich, Germany) and Josef Widder (Interchain, Austria) on the automated verification of randomized distributed algorithms.

• Stéfane Lafortune (University of Michigan, USA) on the control of cyber-physical systems;

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

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

• Mickael Randour (Université de Mons, Belgium) on quantitative games for synthesis.