Quantitative languages
From MaRDI portal
Recommendations
Cited in
(87)- Comparator automata in quantitative verification
- On deterministic weighted automata
- Non-deterministic weighted automata evaluated over Markov chains
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Weighted automata
- A game-theoretic approach for the synthesis of complex systems
- Learning infinite-word automata with loop-index queries
- Computing branching distances with quantitative games
- On the existence of weak subgame perfect equilibria
- A Kleene theorem for weighted tree automata over tree valuation monoids
- Capacitated automata and systems
- Streamable regular transductions
- The complexity of multi-mean-payoff and multi-energy games
- Qualitative analysis of concurrent mean-payoff games
- Hyperplane separation technique for multidimensional mean-payoff games
- A Nivat theorem for weighted picture automata and weighted MSO logics
- The quantitative linear-time-branching-time spectrum
- On weighted first-order logics with discounting
- Computing the average inter-sample time of event-triggered control using quantitative automata
- Quantitative vs. weighted automata
- Expressiveness and closure properties for quantitative languages
- Regular Programming for Quantitative Properties of Data Streams
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- Ratio and weight quantiles
- Parameterized weighted containment
- Automata with Auxiliary Weights
- Finite-valued weighted automata
- On the existence of weak subgame perfect equilibria
- Degree of sequentiality of weighted automata
- Emptiness and universality problems in timed automata with positive frequency
- Coping with selfish on-going behaviors
- On memoryless quantitative objectives
- What's decidable about weighted automata?
- Symbolic model checking in non-Boolean domains
- Probabilistic Weighted Automata
- Generic forward and backward simulations. III: Quantitative simulations by matrices
- Edit distance for pushdown automata
- Quantitative Languages
- R-Automata
- Mean-payoff automaton expressions
- On Omega-Languages Defined by Mean-Payoff Conditions
- Weighted finite automata over hemirings
- General quantitative specification theories with modal transition systems
- scientific article; zbMATH DE number 2040325 (Why is no real title available?)
- Contractibility for open global constraints
- Non-deterministic Weighted Automata on Random Words
- Weighted linear dynamic logic
- scientific article; zbMATH DE number 7559473 (Why is no real title available?)
- Determinisation of finitely-ambiguous copyless cost register automata
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- The big-O problem
- scientific article; zbMATH DE number 7577577 (Why is no real title available?)
- Bidirectional nested weighted automata
- Average stack cost of Büchi pushdown automata
- Weighted safety
- Reactive synthesis without regret
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Quantitative fair simulation games
- Measuring and synthesizing systems in probabilistic environments
- Approximate learning of limit-average automata
- Quantitative Languages Defined by Functional Automata
- Quantitative languages defined by functional automata
- Automata vs linear-programming discounted-sum inclusion
- 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
- Between deterministic and nondeterministic quantitative automata (invited talk)
- Weighted Linear Dynamic Logic
- Integer Weighted Automata on Infinite Words
- Deterministic weighted automata under partial observability
- Decoupled fitness criteria for reactive systems
- An automata theoretic approach to observer design for switched linear systems
- A joint spectral radius for -regular language-driven switched linear systems
- Discounted-sum automata with multiple discount factors
- Quantitative semantics for jumping automata
- Strategic dominance: a new preorder for nondeterministic processes
- Feasability of learning weighted automata on a semiring
- The big-O problem for max-plus automata is decidable (PSPACE-complete)
- Discounted-sum automata with multiple discount factors
- Safety and liveness of quantitative automata
- Discounted-sum automata with real-valued discount factors
- Safety and liveness of quantitative properties and automata
- Boundedness of cost register automata over the integer min-plus semiring
- Quantitative simulations by matrices
- Quantitative language automata
- Integer weighted automata on infinite words
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 Q2946611)
