Semirings, automata, languages
Semirings, automata, languages
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The complexity of stochastic games
Information and Computation
Finite Automata Computing Real Functions
SIAM Journal on Computing
The complexity of mean payoff games on graphs
Theoretical Computer Science
Competitive Markov decision processes
Competitive Markov decision processes
Languages, automata, and logic
Handbook of formal languages, vol. 3
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
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
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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)
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Skew and infinitary formal power series
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Monadic second-order logics with cardinalities
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
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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
Emptiness and universality problems in timed automata with positive frequency
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On memoryless quantitative objectives
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
From boolean to quantitative synthesis
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Automatic verification of real-time systems with rich data: an overview
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The complexity of mean-payoff automaton expression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Input-output robustness for discrete systems
Proceedings of the tenth ACM international conference on Embedded software
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
From software verification to `everyware' verification
Computer Science - Research and Development
Weighted Relational Models of Typed Lambda-Calculi
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
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 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.