Nested weighted automata

K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017) 31.


Journal Article | Published | English
Abstract
Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
Publishing Year
Date Published
2017-12-01
Journal Title
ACM Transactions on Computational Logic (TOCL)
Volume
18
Issue
4
Article Number
31
ISSN
IST-REx-ID

Cite this

Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4):31. doi:10.1145/3152769
Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL), 18(4), 31. https://doi.org/10.1145/3152769
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL) 18, no. 4 (2017): 31. https://doi.org/10.1145/3152769.
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, p. 31, 2017.
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, ACM, 2017, p. 31, doi:10.1145/3152769.

Link(s) to Main File(s)
Access Level
OA Open Access
Material in IST:
Earlier Version
Earlier Version
Earlier Version

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1606.03598

Search this title in

Google Scholar