Quantitative Languages
From MaRDI portal
Publication:3540192
DOI10.1007/978-3-540-87531-4_28zbMATH Open1156.68449OpenAlexW2912461213MaRDI QIDQ3540192FDOQ3540192
Authors: Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger 
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_28
Recommendations
Cited In (64)
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
- Between deterministic and nondeterministic quantitative automata (invited talk)
- Automata vs linear-programming discounted-sum inclusion
- Optimal repair for omega-regular properties
- Determinization of integral discounted-sum automata is decidable
- A Nivat theorem for weighted alternating automata over commutative semirings
- Satisfiability of quantitative probabilistic CTL: rise to the challenge
- Equational weighted tree transformations with discounting
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Quantitative analysis of weighted transition systems
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Parameterized weighted containment
- Probabilistic Weighted Automata
- Coping with selfish on-going behaviors
- Weighted automata and logics on infinite graphs
- On Omega-Languages Defined by Mean-Payoff Conditions
- Valuations of weighted automata: doing it in a rational way
- Mean-payoff automaton expressions
- Monitor Logics for Quantitative Monitor Automata
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- An improved algorithm for determinization of weighted and fuzzy automata
- Approximate determinization of quantitative automata
- Temporal specifications with accumulative values
- What's decidable about weighted automata?
- Model measuring for discrete and hybrid systems
- An abstraction-refinement framework for trigger querying
- Ratio and weight quantiles
- Modeling for Verification
- Determinization of weighted finite automata over strong bimonoids
- Comparator automata in quantitative verification
- Quantitative simulation games
- Expressiveness and closure properties for quantitative languages
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Mean-payoff games with partial observation
- Title not available (Why is that?)
- Weighted register automata and weighted logic on data words
- Generic forward and backward simulations. III: Quantitative simulations by matrices
- Quantitative languages
- Latticed-LTL synthesis in the presence of noisy inputs
- Synthesizing efficient controllers
- Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
- Coping with selfish on-going behaviors
- Quantitative languages defined by functional automata
- What's decidable about weighted automata?
- Weight assignment logic
- Finite-valued weighted automata
- A note on the approximation of mean-payoff games
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Title not available (Why is that?)
- Quantitative vs. weighted automata
- On the supports of recognizable timed series
- Models for quantitative distributed systems and multi-valued logics
- Quantitative Languages Defined by Functional Automata
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Regular Expressions on Average and in the Long Run
- Multi-Valued Reasoning about Reactive Systems
- The inclusion problem for weighted automata on infinite trees
- Rigorous approximated determinization of weighted automata
- Weighted safety
- Weighted finite automata over hemirings
- Max and sum semantics for alternating weighted automata
- Conway and iteration hemirings. I.
- Conway and iteration hemirings. II.
- Quantitative fair simulation games
This page was built for publication: Quantitative Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540192)
