Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Emerson, C. Jutla (1991)
Tree automata, mu-calculus and determinacy[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
A. Hoffman, R. Karp (1966)
On Nonterminating Stochastic GamesManagement Science, 12
M. Droste, D. Kuske (2003)
Skew and infinitary formal power seriesTheor. Comput. Sci., 366
(2005)
man, and R
Z. Manna, A. Pnueli (1991)
The Temporal Logic of Reactive and Concurrent Systems
A. Chakrabarti, K. Chatterjee, T. Henzinger, O. Kupferman, R. Majumdar (2005)
Verifying Quantitative Properties Using Bound Functions
A. Sistla, Moshe Vardi, P. Wolper (1987)
The Complementation Problem for Büchi Automata with Appplications to Temporal LogicTheor. Comput. Sci., 49
K. Chatterjee, L. Doyen, T. Henzinger (2009)
Alternating Weighted Automata
(1957)
Recursive games. In Contributions to the Theory of Games III
Karianto Wong (2005)
Adding Monotonic Counters to Automata and Transition Graphs
W. Kuich, A. Salomaa (1985)
Semirings, Automata and Languages
A. Gurfinkel, M. Chechik (2003)
Multi-Valued Model Checking via Classical Model Checking
(2010)
ACM Transactions on Computational Logic
(2006)
Jeux positionnels
A. Paz (1971)
Introduction to probabilistic automata (Computer science and applied mathematics)
A. Meyer, L. Stockmeyer (1972)
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space
(2008)
Quantitativ e languages
Mehryar Mohri (1997)
Finite-State Transducers in Language and Speech ProcessingComput. Linguistics, 23
M. Droste, W. Kuich, George Rahonis (2008)
Multi-Valued MSO Logics OverWords and TreesFundam. Informaticae, 84
A. Condon (1992)
The Complexity of Stochastic GamesInf. Comput., 96
A. Chakrabarti, L. Alfaro, T. Henzinger, Marielle Stoelinga (2003)
Resource Interfaces
Felix Klaedtke, H. Ruess (2003)
Monadic Second-Order Logics with Cardinalities
H. Seidl, T. Schwentick, A. Muscholl (2003)
Numerical document queries
(2008)
Received August
M. Droste, P. Gastin (2005)
Weighted automata and weighted logicsTheor. Comput. Sci., 380
H. Seidl, T. Schwentick, A. Muscholl, P. Habermehl (2004)
Counting in Trees for Free
D. Krob (1992)
The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable
M. Schützenberger (1961)
On the Definition of a Family of AutomataInf. Control., 4
H. Everett (1958)
2. RECURSIVE GAMES
O. Kupferman, Moshe Vardi (1997)
Weak alternating automata are not that weakProceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
K. Chatterjee, Arkadeb Ghosal, T. Henzinger, D. Iercan, C. Kirsch, C. Pinello, A. Sangiovanni-Vincentelli (2008)
Logical Reliability of Interacting Real-Time Tasks2008 Design, Automation and Test in Europe
Daniel Andersson (2006)
An Improved Algorithm for Discounted Payoff Games
J. Filar, K. Vrieze (1996)
Competitive Markov Decision Processes
K. Chatterjee (2008)
Linear Time Algorithm for Weak Parity GamesArXiv, abs/0805.1391
W. Kuich, A. Salomaa (1985)
Semirings, Automata, Languages, 5
Uri Zwick, M. Paterson (1996)
The Complexity of Mean Payoff Games on GraphsElectron. Colloquium Comput. Complex., TR95
T. Henzinger, O. Kupferman, S. Rajamani (1997)
Fair SimulationInf. Comput., 173
A. Ehrenfeucht, J. Mycielski (1979)
Positional strategies for mean payoff gamesInternational Journal of Game Theory, 8
K. Chatterjee (2006)
Concurrent games with tail objectivesTheor. Comput. Sci., 388
T. Henzinger, K. Chatterjee (2007)
Stochastic o-regular games
(1984)
Reducibility and determinateness of Baire spaces
K. Culík, J. Karhumäki (1994)
Finite Automata Computing Real FunctionsSIAM J. Comput., 23
M. Puterman (1994)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
W. Thomas (1997)
Languages, Automata, and Logic
(2008)
rsch, C
S. Miyano, Takeshi Hayashi (1984)
Alternating Finite Automata on omega-WordsTheor. Comput. Sci., 32
(2010)
Article 23, Publication date
R. Karp (1978)
A characterization of the minimum cycle mean in a digraphDiscret. Math., 23
D. Kirsten, I. Fichtner (2005)
On the Determinization of Weighted AutomataJ. Autom. Lang. Comb., 10
Marielle Stoelinga (2002)
An Introduction to Probabilistic AutomataBull. EATCS, 78
O. Kupferman, Yoad Lustig (2007)
Lattice Automata
Silvano Dal-Zilio, D. Lugiez (2003)
XML schema, tree logic and sheaves automataApplicable Algebra in Engineering, Communication and Computing, 17
T. Liggett, S. Lippman (1969)
Stochastic Games with Perfect Information and Time Average PayoffSiam Review, 11
L. Alfaro, T. Henzinger, R. Majumdar (2003)
Discounting the Future in Systems Theory
Xi-Ren Cao (2007)
Markov Decision Processes
Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of the language-inclusion problem remains open for some classes of weighted automata, we introduce a notion of quantitative simulation that is decidable and implies language inclusion. We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.