Earlier Version

Nested weighted automata

K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015, p. 7174926.

Download
No fulltext has been uploaded. References only!

Conference Paper | 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, nor in any other know 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 run-time 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
2015-07-31
Proceedings Title
Proceedings - Symposium on Logic in Computer Science
Acknowledgement
This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award. A Technical Report of the paper is available at: https://repository.ist.ac.at/331/
Volume
2015-July
Article Number
7174926
Conference
LICS: Logic in Computer Science
Conference Location
Kyoto, Japan
Conference Date
2015-07-06 – 2015-07-10
IST-REx-ID

Cite this

Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: Proceedings - Symposium on Logic in Computer Science. Vol 2015-July. IEEE; 2015:7174926. doi:10.1109/LICS.2015.72
Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July, p. 7174926). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.72
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In Proceedings - Symposium on Logic in Computer Science, 2015–July:7174926. IEEE, 2015. https://doi.org/10.1109/LICS.2015.72.
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July, p. 7174926.
Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July. 7174926.
Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” Proceedings - Symposium on Logic in Computer Science, vol. 2015–July, IEEE, 2015, p. 7174926, doi:10.1109/LICS.2015.72.
Material in IST:
Earlier Version
Earlier Version
Later Version

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1606.03598

Search this title in

Google Scholar