Computer Science – Logic in Computer Science
Scientific paper
2010-06-08
Computer Science
Logic in Computer Science
Scientific paper
Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic mean-payoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions.
Chatterjee Krishnendu
Doyen Laurent
Edelsbrunner Herbert
Henzinger Thomas A.
Rannou Philippe
No associations
LandOfFree
Mean-payoff Automaton Expressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Mean-payoff Automaton Expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mean-payoff Automaton Expressions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29888