Abstract
The innovations in reactive synthesis from Linear Temporal Logics over finite traces (\(\textsf{LTLf}\)) will be amplified by the ability to verify the correctness of the strategies generated by \(\textsf{LTLf}\) synthesis tools. This motivates our work on \(\textsf{LTLf}\) model checking. \(\textsf{LTLf}\) model checking, however, is not straightforward. The strategies generated by \(\textsf{LTLf}\) synthesis may be represented using terminating transducers or non-terminating transducers where executions are of finite-but-unbounded length or infinite length, respectively. For synthesis, there is no evidence that one type of transducer is better than the other since they both demonstrate the same complexity and similar algorithms.
In this work, we show that for model checking, the two types of transducers are fundamentally different. Our central result is that \(\textsf{LTLf}\) model checking of non-terminating transducers is exponentially harder than that of terminating transducers. We show that the problems are EXPSPACE-complete and \(\textsf {PSPACE}\)-complete, respectively. Hence, considering the feasibility of verification, \(\textsf{LTLf}\) synthesis tools should synthesize terminating transducers. This is, to the best of our knowledge, the first evidence to use one transducer over the other in \(\textsf{LTLf}\) synthesis.
A. Wells—Work was performed while the author was at Rice University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Baier, J.A., McIlraith, S.: Planning with temporally extended goals using heuristic search. In: ICAPS, pp. 342–345. AAAI Press (2006)
Bansal, S., Li, Y., Tabajara, L., Vardi, M.: Hybrid compositional reasoning for reactive synthesis from finite-horizon specifications. In: AAAI, vol. 34, pp. 9766–9774 (2020)
Bansal, S., Li, Y., Tabajara, L.M., Vardi, M.Y., Wells, A.M.: Model checking strategies from synthesis over finite traces. CoRR abs/2305.08319 (2023). https://doi.org/10.48550/arXiv.2305.08319
Bansal, S., Namjoshi, K.S., Sa’ar, Y.: Synthesis of coordination programs from linear temporal specifications. Proc. ACM Program. Lang. (POPL) 4, 1–27 (2019)
Bansal, S., Namjoshi, K.S., Sa’ar, Y.: Synthesis of asynchronous reactive programs from temporal specifications. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 367–385. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96145-3_20
Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42(1), 269–291 (1995)
Brafman, R.I., De Giacomo, G.: Planning for LTLf/LDLf goals in non-Markovian fully observable nondeterministic domains. In: IJCAI, pp. 1602–1608 (2019)
Camacho, A., Icarte, R.T., Klassen, T.Q., Valenzano, R.A., McIlraith, S.A.: LTL and beyond: formal languages for reward function specification in reinforcement learning. In: IJCAI, vol. 19, pp. 6065–6073 (2019)
De Giacomo, G., Favorito, M.: Compositional approach to translate LTLf/LDLf into deterministic finite automata. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 31, pp. 122–130 (2021)
De Giacomo, G., Favorito, M., Li, J., Vardi, M.Y., Xiao, S., Zhu, S.: LTLf synthesis as AND-OR graph search: knowledge compilation at work. In: Proceedings of IJCAI (2022)
De Giacomo, G., Iocchi, L., Favorito, M., Patrizi, F.: Foundations for restraining bolts: reinforcement learning with LTLf/LDLf restraining specifications. In: ICAPS, vol. 29, pp. 128–136 (2019)
De Giacomo, G., Rubin, S.: Automata-theoretic foundations of fond planning for LTLf and LDLf goals. In: IJCAI, pp. 4729–4735 (2018)
De Giacomo, G., Vardi, M.: Synthesis for LTL and LDL on finite traces. In: IJCAI, pp. 1558–1564. AAAI Press (2015)
De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI, pp. 854–860. AAAI Press (2013)
De Giacomo, G., Vardi, M.Y.: LTLf and LDLf synthesis under partial observability. In: IJCAI, vol. 2016, pp. 1044–1050 (2016)
Duret-Lutz, A., et al.: From spot 2.0 to spot 2.10: What’s new? In: Shoham, S., Vizel, Y. (eds.) CAV 2022, Part II. Lecture Notes in Computer Science, vol. 13372, pp. 174–187. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-13188-2_9
Esparza, J., Křetínskỳ, J., Sickert, S.: A unified translation of linear temporal logic to \(\omega \)-automata. J. ACM (JACM) 67(6), 1–61 (2020)
Favorito, M.: Forward LTLf synthesis: DPLL at work. arXiv preprint arXiv:2302.13825 (2023)
He, K., Lahijanian, M., Kavraki, L.E., Vardi, M.Y.: Reactive synthesis for finite tasks under resource constraints. In: IROS, pp. 5326–5332. IEEE (2017)
Jacobs, S., Perez, G.A., Schlehuber-Caissier, P.: The temporal logic synthesis format TLSF v1.2 (2023)
Křetínský, J., Meggendorfer, T., Sickert, S.: Owl: a library for \(\omega \)-words, automata, and LTL. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 543–550. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01090-4_34
Kuehlmann, A., van Eijk, C.A.: Combinational and sequential equivalence checking. In: Hassoun, S., Sasao, T. (eds.) Logic Synthesis and Verification. The Springer International Series in Engineering and Computer Science, vol. 654, pp. 343–372. Springer, Boston (2002). https://doi.org/10.1007/978-1-4615-0817-5_13
De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 407–419. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-53479-2_17
Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE (1977)
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179–190 (1989)
Safra, S.: On the complexity of omega -automata. In: FOCS, pp. 319–327 (1988)
Siegel, M., Pnueli, A., Singerman, E.: Translation validation. In: Proceedings of TACAS, pp. 151–166 (1998)
Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM (JACM) 32(3), 733–749 (1985)
Tabajara, L.M., Vardi, M.Y.: Partitioning techniques in LTLf synthesis. In: IJCAI, pp. 5599–5606. AAAI Press (2019)
Tabakov, D., Rozier, K., Vardi, M.Y.: Optimized temporal monitors for SystemC. Formal Meth. Syst. Des. 41(3), 236–268 (2012)
Thomas, W., et al.: Automata, Logics, and Infinite Games: A Guide to Current Research, vol. 2500. Springer, Berlin (2002)
Vardi, M.Y.: The büchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 12–22. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70918-3_2
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS. IEEE Computer Society (1986)
Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1–37 (1994)
Wells, A.M., Lahijanian, M., Kavraki, L.E., Vardi, M.Y.: LTLf synthesis on probabilistic systems. arXiv preprint arXiv:2009.10883 (2020)
Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths. In: FOCS, pp. 185–194. IEEE (1983)
Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: Symbolic LTLf synthesis. In: IJCAI, pp. 1362–1369. AAAI Press (2017)
Acknowledgements
We thank the anonymous reviewers for their valuable feedback. This work has been supported by the Engineering and Physical Sciences Research Council [grant number EP/X021513/1], NASA 80NSSC17K0162, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, CNS-2016656, DoD MURI grant N00014-20-1-2787, and an award from the Maryland Procurement Office.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bansal, S., Li, Y., Tabajara, L.M., Vardi, M.Y., Wells, A. (2023). Model Checking Strategies from Synthesis over Finite Traces. In: André, É., Sun, J. (eds) Automated Technology for Verification and Analysis. ATVA 2023. Lecture Notes in Computer Science, vol 14215. Springer, Cham. https://doi.org/10.1007/978-3-031-45329-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-45329-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-45328-1
Online ISBN: 978-3-031-45329-8
eBook Packages: Computer ScienceComputer Science (R0)