Giovanni Bacci
Skip Abstract Section
Abstract
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.
- [ACHH93] Hybrid automata: an algorithmic approach to the specification and verification of hybrid systemsHybrid systems1993BerlinSpringer20922910.1007/3-540-57318-6_30Google Scholar
Cross Ref
- [AD94] A theory of timed automataTheor Comput Sci19941262183235127158010.1016/0304-3975(94)90010-8Google ScholarDigital Library
- [ALP01] Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. In: Di Benedetto MD, Sangiovani-Vincentelli AL (eds) Proceedings of the 4th international workshop on hybrid systems: computation and control (HSCC'01), volume 2034 of lecture notes in computer science. Springer, Berlin, pp 49–62Google Scholar
- [BBF+18] Optimal and robust controller synthesis–using energy timed automata with uncertaintyFormal methods–22nd international symposium, FM 20182018BerlinSpringer203221Google Scholar
- [BBKT01] The stability of saturated linear dynamical systems is undecidableJ Comput Syst Sci2001623442462182445510.1006/jcss.2000.1737Google ScholarDigital Library
- [BCD+07] UPPAAL-Tiga: time for playing games!Computer aided verification, 19th international conference, CAV 2007, Berlin, Germany, July 3–7, 2007, proceedings2007BerlinSpringer121125Google Scholar
- [BFH+01] Behrmann G, Fehnker A, Hune T, Larsen KG, Pettersson P, Romijn J, Vaandrager F (2001) Minimum-cost reachability for priced timed automata. In: Di Benedetto MD, Sangiovani-Vincentelli AL (eds) Proceedings of the 4th international workshop on hybrid systems: computation and control (HSCC'01), volume 2034 of lecture notes in computer science. Springer, Berlin, pp 147–161Google Scholar
- [BFL+08] Bouyer P, Fahrenberg U, Larsen KG, Markey N, Srba J (2008) Infinite runs in weighted timed automata with energy constraints. In: Cassez F, Jard C (eds) Proceedings of the 6th international conferences on formal modelling and analysis of timed systems (FORMATS'08), volume 5215 of lecture notes in computer science. Springer, Berlin, pp 33–47Google Scholar
- [BFLM10] Bouyer P, Fahrenberg U, Larsen KG, Markey N (2010) Timed automata with observers under energy constraints. In: Johansson KH, Yi W (eds) Proceedings of the 13th international workshop on hybrid systems: computation and control (HSCC'10). ACM Press, pp 61–70Google Scholar
- [BFTM00] Observability and controllability of piecewise affine and hybrid systemsIEEE Trans Autom Control2000451018641876179535410.1109/TAC.2000.880987Google ScholarCross Ref
- [BGH+16] Bisgaard M, Gerhardt D, Hermanns H, Krcál J, Nies G, Stenger M (2016) Battery-aware scheduling in low orbit: the GomX-3 case. In: Fitzgerald JS, Heitmeyer CL, Gnesi S, Philippou A (eds) FM 2016: Formal methods—21st international symposium, Limassol, Cyprus, November 9–11, 2016, proceedings, volume 9995 of lecture notes in computer science, pp 559–576Google Scholar
- [BIL06] Bozga M, Iosif R, Lakhnech Y (2006) Flat parametric counter automata. In: Bugliesi M, Preneel B, Sassone V, Wegener I (eds) Proceedings of the 33rd international colloquium on automata, languages and programming (ICALP'06))— part II, volume 4052 of lecture notes in computer science. Springer, Berlin, pp 577–588Google Scholar
- [BLM14] Bouyer P, Larsen KG, Markey N (2014) Lower-bound constrained runs in weighted timed automata. Perform Eval 73:91–109, MarchGoogle Scholar
- [BT99] Complexity of stability and controllability of elementary hybrid systemsAutomatica1999353479489183191710.1016/S0005-1098(98)00175-7Google ScholarDigital Library
- [CDF+05] Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005–concurrency theory, 16th international conference, CONCUR 2005, San Francisco, CA, USA, August 23–26, 2005, proceedings. lecture notes in computer science, vol. 3653, pp. 66–80. Springer (2005)Google Scholar
- [CFL19] Cachera, D., Fahrenberg, U., Legay, A.: An -algebra for real-time energy problems. Log Methods Comput Sci 15(2), (2019)Google Scholar
- [CJ98] Comon H, Jurski Y (1998) Multiple counters automata, safety analysis, and Presburger arithmetic. In: Hu AJ, Vardi MY (eds) Proceedings of the 10th international conference on computer aided verification (CAV'98), volume 1427 of lecture notes in computer science. Springer, Berlin, pp 268–279Google Scholar
- [CJL+09] Cassez F, Jensen JJ, Larsen KG, Raskin J-F, Reynier P-A (2009) Automatic synthesis of robust and optimal controllers—an industrial case study. In: Majumdar R, Tabuada P (eds) Proceedings of the 12th international workshop on hybrid systems: computation and control (HSCC'09), volume 5469 of lecture notes in computer science. Springer, Berlin, pp 90–104Google Scholar
- [DJL+14] On time with minimal expected cost!Automated technology for verification and analysis–12th international symposium, ATVA 2014, Sydney, NSW, Australia, November 3–7, 2014, proceedings2014BerlinSpringer129145Google Scholar
- [DJL+15] David A, Jensen PG, Larsen KG, Mikucionis M, Taankvist JH (2015) Uppaal Stratego. In: Baier C, Tinelli C (eds) Tools and algorithms for the construction and analysis of systems–21st international conference, TACAS 2015, held as part of the European joint conferences on theory and practice of software, ETAPS 2015, London, UK, April 11–18: Proceedings. lecture notes in computer science, vol. 9035, pp. 206–211. Springer, Berlin (2015)Google Scholar
- [Fre08] PHAVer: algorithmic verification of hybrid systems past HyTechSTTT200810326327910.1007/s10009-007-0062-xGoogle ScholarCross Ref
- [JST11] Jha S, Seshia SA, Tiwari A (2011) Synthesis of optimal switching logic for hybrid systems. In: Chakraborty S, Jerraya A, Baruah SK, Fischmeister S (eds) Proceedings of the 11th international conference on embedded software, EMSOFT 2011, part of the seventh embedded systems week, ESWeek 2011, Taipei, Taiwan, October 9–14, 2011. ACM, pp 107–116Google Scholar
- [Mar11] Verification of embedded systems–algorithms and complexity2011École Normale Supérieure de Cachan, France, AprilMémoire d'habilitationGoogle Scholar
- [MFÅL15] Symbolic supervisory control of timed discrete event systemsIEEE Trans Control Syst Technol201523258459710.1109/TCST.2014.2335052Google Scholar
- [Mon10] Monniaux, D., (2010) Quantifier elimination by lazy model enumeration. In: Touili T, Cook B, Jackson PB (eds) Computer aided verification, 22nd international conference, CAV 2010, Edinburgh, UK, July 15–19, : Proceedings. lecture notes in computer science, vol. 6174, pp. 585–599. Springer, Berlin (2010)Google Scholar
- [PHM14] EHRA: specification and analysis of energy-harvesting wireless sensor networksSpecification, algebra, and software–essays dedicated to Kokichi Futatsugi2014BerlinSpringer52054010.1007/978-3-642-54624-2_26Google Scholar
- [Qua] Quasimodo. Quantitative system properties in model-driven design of embedded systems. http://www.quasimodo.aau.dk/Google Scholar
- [vBHLO17] Synthesizing and verifying controllers for multi-lane traffic maneuversFormal Asp Comput2017294583600366523610.1007/s00165-017-0424-4Google ScholarDigital Library
- [Wol] Wolfram Research, Inc. (2017) Mathematica, Version 11.2. Champaign, ILGoogle Scholar
- [ZZKL12] Zhao H, Zhan N, Kapur D, Larsen KG (2012) A "hybrid" approach for synthesizing optimal controllers of hybrid systems: a case study of the oil pump industrial example. In: Giannakopoulou D, Méry D (eds) FM 2012: formal methods–18th international symposium, Paris, France, August 27–31: Proceedings. lecture notes in computer science, vol. 7436, pp. 471–485. Springer, Berlin (2012)Google Scholar
Recommendations
Bounds on the automata size for Presburger arithmetic
Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by the automata-based approach for Presburger arithmetic. In this article, we give an ...
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
In this paper we consider the problem of computing the optimal (minimum or maximum) expected time to reach a target and the synthesis of an optimal controller for a probabilistic timed automaton (PTA). Although this problem admits solutions that employ ...
Comments