Nested weighted limit-average automata of bounded width

Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan (2016) Nested weighted limit-average automata of bounded width. In: MFCS: Mathematical Foundations of Computer Science, August 22-26, 2016, Krakow, Poland.

[img] Text
LIPIcs-MFCS-2016-24.pdf - Published Version
Available under License Creative Commons Attribution.
[IST-2017-795-v1+1]
Download (551Kb)
Official URL: http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.24

Abstract

While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Complexity; weighted automata; nested weighted automata; mean-payoff
Subjects: 000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems > 004 Data processing & computer science
Research Group: Chatterjee Group
Henzinger Group
SWORD Depositor: Sword Import User
Depositing User: Sword Import User
Date Deposited: 16 Mar 2017 08:11
Last Modified: 16 Mar 2017 08:14
URI: https://repository.ist.ac.at/id/eprint/795

Actions (login required)

View Item View Item