TY - GEN

T1 - Max and sum semantics for alternating weighted automata

AU - Almagor, Shaull

AU - Kupferman, Orna

PY - 2011

Y1 - 2011

N2 - In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between disjunctions/conjunctions in the specification and nondeterministic/universal transitions in the automaton for the specification is straightforward. A recent exciting research direction aims at adding a quality measure to the satisfaction of specifications of reactive systems. The corresponding automata-theoretic framework is based on weighted automata, which map input words to numerical values. In the weighted setting, nondeterminism has a minimum semantics - the weight that an automaton assigns to a word is the cost of the cheapest run on it. For universal branches, researchers have studied a (dual) maximum semantics. We argue that a summation semantics is of interest too, as it captures the intuition that one has to pay for the cost of all conjuncts. We introduce and study alternating weighted automata on finite words in both the max and sum semantics. We study the duality between the min and max semantics, closure under max and sum, the added power of universality and alternation, and arithmetic operations on automata. In particular, we show that universal weighted automata in the sum semantics can represent all polynomials.

AB - In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between disjunctions/conjunctions in the specification and nondeterministic/universal transitions in the automaton for the specification is straightforward. A recent exciting research direction aims at adding a quality measure to the satisfaction of specifications of reactive systems. The corresponding automata-theoretic framework is based on weighted automata, which map input words to numerical values. In the weighted setting, nondeterminism has a minimum semantics - the weight that an automaton assigns to a word is the cost of the cheapest run on it. For universal branches, researchers have studied a (dual) maximum semantics. We argue that a summation semantics is of interest too, as it captures the intuition that one has to pay for the cost of all conjuncts. We introduce and study alternating weighted automata on finite words in both the max and sum semantics. We study the duality between the min and max semantics, closure under max and sum, the added power of universality and alternation, and arithmetic operations on automata. In particular, we show that universal weighted automata in the sum semantics can represent all polynomials.

UR - http://www.scopus.com/inward/record.url?scp=80054069613&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24372-1_2

DO - 10.1007/978-3-642-24372-1_2

M3 - Conference contribution

AN - SCOPUS:80054069613

SN - 9783642243714

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 13

EP - 27

BT - Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings

T2 - 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011

Y2 - 11 October 2011 through 14 October 2011

ER -