Nested weighted automata Journal Article


Author(s): Chatterjee, Krishnendu; Henzinger, Thomas A; Otop, Jan
Article Title: Nested weighted automata
Affiliation IST Austria
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.
Keywords: Weighted automata; Model measuring; Nested automata; Quantitative properties
Journal Title: ACM Transactions on Computational Logic (TOCL)
Volume: 18
Issue 4
ISSN: 1557-945X
Publisher: ACM  
Date Published: 2017-12-01
Start Page: Article number: 31
DOI: 10.1145/3152769
Notes: A Technical Report of this paper is avalable via: https://repository.ist.ac.at/331/ 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), Microsoft faculty fellows award, and by the National Science Centre (NCN), Poland, under grant 2014/15/D/ST6/0454.
Open access: yes (repository)
IST Austria Authors
  1. Thomas A. Henzinger
    415 Henzinger
Related IST Austria Work