Nicolas Markey

Abstract

In this paper, we propose a novel framework for the synthesis of robust and optimal energy-aware controllers. The framework is based on energy timed automata, allowing for easy expression of timing-constraints and variable energy-rates. We prove decidability of the energy-constrained infinite-run problem in settings with both certainty and uncertainty of the energy-rates. We also consider the optimization problem of identifying the minimal upper bound that will permit existence of energy-constrained infinite runs. Our algorithms are based on quantifier elimination for linear real arithmetic. Using Mathematica and Mjollnir, we illustrate our framework through a real industrial example of a hydraulic oil pump. Compared with previous approaches our method is completely automated and provides improved results.

@inproceedings{fm2018-BBFLMR,
  author =              {Bacci, Giovanni and Bouyer, Patricia and Fahrenberg,
                         Uli and Larsen, Kim Guldstrand and Markey, Nicolas
                         and Reynier, Pierre-Alain},
  title =               {Optimal and Robust Controller Synthesis Using Energy
                         Timed Automata with Uncertainty},
  editor =              {Havelund, Klaus and Peleska, Jan and Roscoe, Bill W.
                         and de Vink, Erik},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {S}ymposium on {F}ormal {M}ethods ({FM}'18)},
  acronym =             {{FM}'18},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {10951},
  pages =               {203-221},
  year =                {2018},
  month =               jul,
  doi =                 {10.1007/978-3-319-95582-7_12},
  abstract =            {In this paper, we propose a novel framework for the
                         synthesis of robust and optimal energy-aware
                         controllers. The framework is based on energy timed
                         automata, allowing for easy expression of
                         timing-constraints and variable energy-rates. We
                         prove decidability of the energy-constrained
                         infinite-run problem in settings with both certainty
                         and uncertainty of the energy-rates. We also
                         consider the optimization problem of identifying the
                         minimal upper bound that will permit existence of
                         energy-constrained infinite runs. Our algorithms are
                         based on quantifier elimination for linear real
                         arithmetic. Using Mathematica and Mjollnir, we
                         illustrate our framework through a real industrial
                         example of a hydraulic oil pump. Compared with
                         previous approaches our method is completely
                         automated and provides improved results.},
}