Quantitative languages
From MaRDI portal
Publication:2946611
DOI10.1145/1805950.1805953zbMath1351.68155OpenAlexW2294334272MaRDI QIDQ2946611
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1805950.1805953
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (54)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ Learning infinite-word automata with loop-index queries ⋮ Integer weighted automata on infinite words ⋮ Edit Distance for Pushdown Automata ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Computing the average inter-sample time of event-triggered control using quantitative automata ⋮ General quantitative specification theories with modal transition systems ⋮ Contractibility for open global constraints ⋮ Quantitative safety and liveness ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ Computing the sampling performance of event-triggered control ⋮ ETCetera: beyond Event-Triggered Control ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Weighted Linear Dynamic Logic ⋮ Integer Weighted Automata on Infinite Words ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Quantitative vs. weighted automata ⋮ Automata with Auxiliary Weights ⋮ Unnamed Item ⋮ Computing branching distances with quantitative games ⋮ On the Existence of Weak Subgame Perfect Equilibria ⋮ Degree of Sequentiality of Weighted Automata ⋮ The quantitative linear-time-branching-time spectrum ⋮ On the existence of weak subgame perfect equilibria ⋮ On weighted first-order logics with discounting ⋮ Quantitative Automata under Probabilistic Semantics ⋮ Non-deterministic Weighted Automata on Random Words ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Reactive synthesis without regret ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Quantitative fair simulation games ⋮ Non-deterministic weighted automata evaluated over Markov chains ⋮ Unnamed Item ⋮ Decidable weighted expressions with Presburger combinators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ Quantitative simulations by matrices ⋮ Unnamed Item ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ On deterministic weighted automata ⋮ On Memoryless Quantitative Objectives ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Weighted automata ⋮ Bidirectional nested weighted automata ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES ⋮ The complexity of multi-mean-payoff and multi-energy games ⋮ A game-theoretic approach for the synthesis of complex systems ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Average Stack Cost of Büchi Pushdown Automata
This page was built for publication: Quantitative languages
