Abstract
While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-by-construction synthesis problem by considering the specifications to be expressed by a robust version of Linear Temporal Logic (\(\textrm{LTL}\)), called robust \(\textrm{LTL}\) (\(\textrm{rLTL}\)). rLTL has a many-valued semantics to capture different degrees of satisfaction of a specification, i.e., satisfaction is a quantitative notion.
We argue that the current algorithms for \(\textrm{rLTL}\) synthesis do not compute optimal strategies in a non-antagonistic setting. So, a natural question is whether there is a way of satisfying the specification “better” if the environment is indeed not antagonistic. We address this question by developing two new notions of strategies. The first notion is that of adaptive strategies, which, in response to the opponent’s non-antagonistic moves, maximize the degree of satisfaction. The idea is to monitor non-optimal moves of the opponent at runtime using multiple parity automata and adaptively change the system strategy to ensure optimality. The second notion is that of strongly adaptive strategies, which is a further refinement of the first notion. These strategies also maximize the opportunities for the opponent to make non-optimal moves. We show that computing such strategies for \(\textrm{rLTL}\) specifications is not harder than the standard synthesis problem, e.g., computing strategies with \(\textrm{LTL}\) specifications, and takes doubly-exponential time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Almagor, S., Kupferman, O.: Good-enough synthesis. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, Part II. LNCS, vol. 12225, pp. 541–563. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53291-8_28
Anevlavis, T., Neider, D., Phillipe, M., Tabuada, P.: Evrostos: the rLTL verifier. In: ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2019, pp. 218–223. ACM (2019). https://doi.org/10.1145/3302504.3311812
Anevlavis, T., Philippe, M., Neider, D., Tabuada, P.: Verifying rLTL formulas: now faster than ever before! In: IEEE Conference on Decision and Control, CDC 2018, pp. 1556–1561. IEEE (2018). https://doi.org/10.1109/CDC.2018.8619014
Anevlavis, T., Philippe, M., Neider, D., Tabuada, P.: Being correct is not enough: efficient verification using Robust Linear Temporal Logic. ACM Trans. Comput. Log. 23(2), 8:1–8:39 (2022). https://doi.org/10.1145/3491216
Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)
Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20(4), 1–64 (2011). https://doi.org/10.1145/2000799.2000800
Bloem, R., et al.: Synthesizing robust systems. Acta Informatica 51(3–4), 193–220 (2014). https://doi.org/10.1007/s00236-013-0191-5
Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140–156. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02658-4_14
Bloem, R., Ehlers, R., Jacobs, S., Könighofer, R.: How to handle assumptions in synthesis. In: Workshop on Synthesis, SYNT 2014. EPTCS, vol. 157, pp. 34–50 (2014). https://doi.org/10.4204/EPTCS.157.7
Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 252–263. ACM (2017). https://doi.org/10.1145/3055399.3055409
Chatterjee, K., Doyen, L.: Energy parity games. Theor. Comput. Sci. 458, 49–60 (2012). https://doi.org/10.1016/j.tcs.2012.07.038
Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 261–275. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71209-1_21
Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 178–187. IEEE Computer Society (2005). https://doi.org/10.1109/LICS.2005.26
Chatterjee, K., Horn, F., Löding, C.: Obliging games. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 284–296. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15375-4_20
Dallal, E., Neider, D., Tabuada, P.: Synthesis of safety controllers robust to unmodeled intermittent disturbances. In: IEEE Conference on Decision and Control, CDC 2016, pp. 7425–7430. IEEE (2016). https://doi.org/10.1109/CDC.2016.7799416
Ehlers, R., Topcu, U.: Resilience to intermittent assumption violations in reactive synthesis. In: International Conference on Hybrid Systems: Computation and Control, HSCC 2014, pp. 203–212. ACM (2014). https://doi.org/10.1145/2562059.2562128
Fearnley, J., Zimmermann, M.: Playing Muller games in a hurry. Int. J. Found. Comput. Sci. 23(3), 649–668 (2012). https://doi.org/10.1142/S0129054112400321
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36387-4
Kuhn, H.W.: Extensive Games and the Problem of Information. Princeton University Press, Princeton (1953)
Majumdar, R., Render, E., Tabuada, P.: A theory of robust omega-regular software synthesis. ACM Trans. Embed. Comput. Syst. 13(3), 48:1–48:27 (2013). https://doi.org/10.1145/2539036.2539044
Mascle, C., Neider, D., Schwenger, M., Tabuada, P., Weinert, A., Zimmermann, M.: From LTL to rLTL monitoring: improved monitorability through robust semantics. In: HSCC 2020: 23rd ACM International Conference on Hybrid Systems: Computation and Control, pp. 7:1–7:12. ACM (2020). https://doi.org/10.1145/3365365.3382197
Nayak, S.P., Neider, D., Roy, R., Zimmermann, M.: Robust computation tree logic. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NASA Formal Methods. LNCS, vol. 13260, pp. 538–556. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-06773-0_29
Nayak, S.P., Neider, D., Zimmermann, M.: Adaptive strategies for rLTL games. In: HSCC 2021: ACM International Conference on Hybrid Systems: Computation and Control, pp. 32:1–32:2. ACM (2021). https://doi.org/10.1145/3447928.3457210
Nayak, S.P., Neider, D., Zimmermann, M.: Robustness-by-construction synthesis: adapting to the environment at runtime. CoRR abs/2204.10912 (2022). https://doi.org/10.48550/arXiv.2204.10912
Neider, D., Totzke, P., Zimmermann, M.: Optimally resilient strategies in pushdown safety games. In: International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. LIPIcs, vol. 170, pp. 74:1–74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.MFCS.2020.74
Neider, D., Weinert, A., Zimmermann, M.: Synthesizing optimally resilient controllers. In: EACSL Annual Conference on Computer Science Logic, CSL 2018. LIPIcs, vol. 119, pp. 34:1–34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018). https://doi.org/10.4230/LIPIcs.CSL.2018.34
Neider, D., Weinert, A., Zimmermann, M.: Robust, expressive, and quantitative linear temporal logics: pick any two for free. Inf. Comput. 104810 (2021). https://doi.org/10.1016/j.ic.2021.104810
Pnueli, A.: The temporal logic of programs. In: Symposium on Foundations of Computer Science, 1977, pp. 46–57. IEEE Computer Society (1977). https://doi.org/10.1109/SFCS.1977.32
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: ACM Symposium on Principles of Programming Languages, 1989, pp. 179–190. ACM Press (1989). https://doi.org/10.1145/75277.75293
Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652–671. Springer, Heidelberg (1989). https://doi.org/10.1007/BFb0035790
Priest, G.: Dualising intuitionictic negation. Principia Int. J. Epistemol. 13(2), 165–184 (2009). https://doi.org/10.5007/1808-1711.2009v13n2p165
Samuel, S., Mallik, K., Schmuck, A., Neider, D.: Resilient abstraction-based controller design. In: HSCC 2020: ACM International Conference on Hybrid Systems: Computation and Control, pp. 33:1–33:2. ACM (2020). https://doi.org/10.1145/3365365.3383467
Samuel, S., Mallik, K., Schmuck, A., Neider, D.: Resilient abstraction-based controller design. In: IEEE Conference on Decision and Control, CDC 2020, pp. 2123–2129. IEEE (2020). https://doi.org/10.1109/CDC42340.2020.9303932
Schewe, S., Varghese, T.: Tight bounds for the determinisation and complementation of generalised Büchi automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 42–56. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33386-6_5
Tabuada, P., Caliskan, S.Y., Rungger, M., Majumdar, R.: Towards robustness for cyber-physical systems. IEEE Trans. Autom. Control 59(12), 3151–3163 (2014). https://doi.org/10.1109/TAC.2014.2351632
Tabuada, P., Neider, D.: Robust linear temporal logic. In: Conference on Computer Science Logic, CSL 2016. LIPIcs, vol. 62, pp. 10:1–10:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016). https://doi.org/10.4230/LIPIcs.CSL.2016.10
Topcu, U., Ozay, N., Liu, J., Murray, R.M.: On synthesizing robust discrete controllers under modeling uncertainty. In: Hybrid Systems: Computation and Control, HSCC 2012, pp. 85–94. ACM (2012). https://doi.org/10.1145/2185632.2185648
Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 212–223. Springer, Heidelberg (2006). https://doi.org/10.1007/11944836_21
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nayak, S.P., Neider, D., Zimmermann, M. (2022). Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles. ISoLA 2022. Lecture Notes in Computer Science, vol 13701. Springer, Cham. https://doi.org/10.1007/978-3-031-19849-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-19849-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19848-9
Online ISBN: 978-3-031-19849-6
eBook Packages: Computer ScienceComputer Science (R0)