Semirings, automata, languages
Semirings, automata, languages
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
The complexity of stochastic games
Information and Computation
Competitive Markov decision processes
Competitive Markov decision processes
Languages, automata, and logic
Handbook of formal languages, vol. 3
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Finite-state transducers in language and speech processing
Computational Linguistics
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Weighted automata and weighted logics
Theoretical Computer Science
Concurrent games with tail objectives
Theoretical Computer Science
Logical reliability of interacting real-time tasks
Proceedings of the conference on Design, automation and test in Europe
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Verifying quantitative properties using bound functions
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
On Omega-Languages Defined by Mean-Payoff Conditions
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Survey of Stochastic Games with Limsup and Liminf Objectives
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Time for verification
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Mean-payoff automaton expressions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Regular expressions on average and in the long run
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Models for quantitative distributed systems and multi-valued logics
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
An abstraction-refinement framework for trigger querying
SAS'11 Proceedings of the 18th international conference on Static analysis
Max and sum semantics for alternating weighted automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Coping with selfish on-going behaviors
Information and Computation
Weighted automata and multi-valued logics over arbitrary bounded lattices
Theoretical Computer Science
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Synthesizing efficient controllers
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
A temporal logic with mean-payoff constraints
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Parameterized weighted containment
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Decision problems for additive regular functions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Quantitative reactive modeling and verification
Computer Science - Research and Development
A note on the approximation of mean-payoff games
Information Processing Letters
Hi-index | 0.00 |
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 language inclusion 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.