Deterministic Weighted Automata under Partial Observability
Abstract: Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Quantitative specification can be assisted by automata learning as there are classic results on Angluin-style learning of weighted automata. The existing work assumes perfect information about the values returned by the target weighted automaton. In assisted synthesis of a quantitative specification, knowledge of the exact values is a strong assumption and may be infeasible. In our work, we address this issue by introducing a new framework of partially-observable deterministic weighted automata, in which weighted automata return intervals containing the computed values of words instead of the exact values. We study the basic properties of this framework with the particular focus on the challenges of
- Dana Angluin. Learning regular sets from queries and counterexamples. Information and computation, 75(2):87–106, 1987.
- Learning functions represented as multiplicity automata. J. ACM, 47(3):506–530, 2000.
- Handbook of modal logic. Elsevier, 2006.
- Reachability in two-dimensional vector addition systems with states is pspace-complete. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, pages 32–43. IEEE Computer Society, 2015.
- Quantitative languages. ACM Trans. Comput. Log., 11(4):23:1–23:38, 2010.
- Nested weighted automata. ACM Trans. Comput. Log., 18(4):31:1–31:44, 2017.
- Handbook of model checking, volume 10. Springer, 2018.
- Games with imperfect information: theory and algorithms. In Krzysztof R. Apt and Erich Grädel, editors, Lectures in Game Theory for Computer Scientists, pages 185–212. Cambridge University Press, 2011.
- Handbook of weighted automata. Springer Science & Business Media, 2009.
- Epistemic atl with perfect recall, past and strategy contexts. In Computational Logic in Multi-Agent Systems: 13th International Workshop, CLIMA XIII, Proceedings 13, pages 77–93. Springer, 2012.
- From model checking to model measuring. In Pedro R. D’Argenio and Hernán C. Melgratti, editors, CONCUR 2013 - Concurrency Theory - 24th International Conference. Proceedings, volume 8052 of Lecture Notes in Computer Science, pages 273–287. Springer, 2013.
- Introduction to Automata Theory, Languages, and Computation. Adison-Wesley Publishing Company, Reading, Massachusets, USA, 1979.
- Quantitative games with interval objectives. In Venkatesh Raman and S. P. Suresh, editors, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, volume 29 of LIPIcs, pages 365–377. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.
- Complexity of equivalence and learning for multiplicity tree automata. Journal of Machine Learning Research, 16:2465–2500, 2015.
- Minimization of limit-average automata. In Zhi-Hua Zhou, editor, Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021, pages 2819–2825. ijcai.org, 2021.
- Learning infinite-word automata with loop-index queries. Artif. Intell., 307:103710, 2022.
- Ian Millington. AI for Games. CRC Press, 2019.
- The complexity of markov decision processes. Math. Oper. Res., 12(3):441–450, 1987.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.