Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations
Information and Computation
Digital images and formal languages
Handbook of formal languages, vol. 3
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Finite-state transducers in language and speech processing
Computational Linguistics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 0.00 |
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.